Method and apparatus for decoding video, and method and apparatus for encoding video

ABSTRACT

A video decoding and video encoding method of performing inter prediction in a bi-directional motion prediction mode, in which a prediction pixel value of a current block may be generated by not only using a pixel value of a first reference block of a first reference picture and a pixel value of a second reference block of a second reference picture, but also using a first gradient value of the first reference block and a second gradient value of the second reference block, in a bi-directional motion prediction mode. Accordingly, encoding and decoding efficiency may be increased since a prediction block similar to an original block may be generated.

TECHNICAL FIELD

The present disclosure relates to a video decoding method and a video encoding method. More particularly, the present disclosure relates to video decoding and video encoding performing inter prediction in a bi-directional motion prediction mode.

BACKGROUND ART

As hardware for reproducing and storing high resolution or high quality video content is being developed and supplied, a need for a video codec for effectively encoding or decoding high resolution or high quality video content has increased. In a conventional video codec, a video is encoded according to a limited encoding method based on coding units of a tree structure.

Image data of a spatial domain is transformed into coefficients of a frequency domain via frequency transformation. According to a video codec, an image is split into blocks having a predetermined size, discrete cosine transform (DCT) is performed on each block, and frequency coefficients are encoded in block units, for rapid calculation of frequency transformation. Compared with image data of a spatial domain, coefficients of a frequency domain are easily compressed. In particular, since an image pixel value of a spatial domain is expressed according to a prediction error via inter prediction or intra prediction of a video codec, when frequency transformation is performed on the prediction error, a large amount of data may be transformed to 0. According to a video codec, an amount of data may be reduced by replacing data that is consecutively and repeatedly generated with small-sized data.

DESCRIPTION OF EMBODIMENTS Technical Problem

According to various embodiments, a prediction pixel value of a current block may be generated by not only using a pixel value of a first reference block of a first reference picture and a pixel value of a second reference block of a second reference picture, but also using a first gradient value of the first reference block and a second gradient value of the second reference block, in a bi-directional motion prediction mode. Accordingly, encoding and decoding efficiency may be increased since a prediction block similar to an original block may be generated.

Provided is a computer-readable recording medium having recorded thereon a program for executing a method according to various embodiments.

Here, aspects of various embodiments are not limited thereto, and additional aspects will be set forth in part in the description which follows and, in part, will be apparent from the description, or may be learned by practice of the presented embodiments.

Solution to Problem

Aspects of the present disclosure are not limited thereto, and additional aspects will be set forth in part in the description which follows and, in part, will be apparent from the description, or may be learned by practice of the presented embodiments.

According to an aspect of the present disclosure, a video decoding method includes: obtaining, from a bitstream, motion prediction mode information regarding a current block in a current picture; when the obtained motion prediction mode information indicates a bi-directional motion prediction mode, obtaining, from the bitstream, a first motion vector indicating a first reference block of the current block in a first reference picture and a second motion vector indicating a second reference block of the current block in a second reference picture; generating a pixel value of a first pixel from among pixels of the first reference block indicated by the first motion vector and a pixel value of a second pixel from among pixels of the second reference block indicated by the second motion vector by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel; generating a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region and the second neighboring region; and generating a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel.

The generating of the prediction pixel value of the current block may include: determining displacement vectors per unit time in a horizontal direction and a vertical direction by using gradient values of pixels in a first window having a certain size and including the first pixel, gradient values of pixels in a second window having a certain size and including the second pixel, pixel values of the pixels in the first window, and pixel values of the pixels in the second window; and generating the prediction pixel value of the current block by further using the displacement vectors per unit time in the horizontal direction and the vertical direction, a first temporal distance between the current picture and the first reference picture, and a second temporal distance between the current picture and the second reference picture.

The first motion vector may be a vector indicating the first pixel at a fractional pixel position (i+α, j+β), wherein i and j are each an integer and α and β are each a fraction, and the generating of the gradient value of the first pixel and the gradient value of the second pixel may include: generating a gradient value at a pixel position (i, j+β) by applying a gradient filter to a pixel value at a pixel position (i, j) and pixel values of integer pixels positioned in a vertical direction from a pixel at the pixel position (i, j); and generating a gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by applying an interpolation filter to the gradient value at the pixel position (i, j+β) and gradient values of pixels, in which a position of a horizontal component is an integer pixel position, from among pixels positioned in the horizontal direction from the pixel position (i, j+β).

The first motion vector may be a vector indicating the first pixel at a fractional pixel position (i+α, j+β), wherein i and j are each an integer and α and β are each a fraction, and the generating of the gradient value of the first pixel and the gradient value of the second pixel may include: generating a pixel value at a pixel position (i, j+β) by applying an interpolation filter to a pixel value at a pixel position (i, j) and pixel values of integer pixels positioned in a vertical direction from a pixel at the pixel position (i, j); and generating a gradient value of the first pixel in the horizontal direction at the fractional pixel position (i+α, j+β) by applying a gradient filter to the pixel value at the pixel position (i, j+β) and pixel values of pixels, in which a position of a horizontal component is an integer pixel position, from among pixels positioned in the horizontal direction from the pixel position (i, j+β).

The generating of the gradient value at a pixel position (i, j+β) may include generating the gradient value at the pixel position (i, j+β) by applying an M-tap gradient filter with respect to the pixel at the pixel position (i, j) and M−1 neighboring integer pixels positioned in the vertical direction from the pixel at the pixel position (i, j), wherein M is an integer, and the generating of the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) may include generating the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by applying an N-tap interpolation filter with respect to the gradient value at the pixel position (i, j+β) and gradient values of N−1 pixels, in which a position of a horizontal component is an integer pixel position, from among pixels positioned in the horizontal direction from the pixel position (i, j+β), wherein N is an integer.

The generating of the pixel value at the pixel position (i, j+β) may include generating the pixel value at the pixel position (i, j+β) by applying an N-tap interpolation filter with respect to the pixel value at the pixel position (i, j+β) and pixel values of N−1 neighboring pixels, in which a component in a predetermined direction is an integer, the N−1 neighboring pixels positioned in the vertical direction from the pixel position (i, j+β), wherein N is an integer, and the generating of the gradient value of the first pixel in the horizontal direction at the fractional pixel position (i+α, j+β) may include generating the gradient value of the first pixel in the horizontal direction at the fractional pixel position (i+α, j+β) by applying an M-tap gradient filter with respect to the pixel value at the pixel position (i, j+β) and pixel values of M−1 pixels, in which a position of a horizontal component is an integer pixel position, from among the pixels positioned in the horizontal direction from the pixel position (i, j+β), wherein M is an integer.

The N-tap interpolation filter may be a discrete cosine transform-based interpolation filter for a pixel value at a fractional pixel position in a horizontal direction, and N may be 6.

The M-tap gradient filter may be an interpolation filter for a gradient value at a fractional pixel position in a vertical direction, in which a filter coefficient is pre-determined by using a discrete cosine transform-based interpolation filter in the vertical direction, and M may be 6.

The generating of the gradient value at the pixel position (i, j+β) by applying the M-tap gradient filter may include generating the gradient value at the pixel position (i, j+β) by performing de-scaling on a value to which the M-tap gradient filter is applied, based on a de-scaling bit number, wherein the de-scaling bit number may be based on a bit depth of a sample, and the de-scaling may include bit-shifting to right by the de-scaling bit number.

When a filter coefficient of the M-tap gradient filter is scaled by 2{circumflex over ( )}x and a filter coefficient of the N-tap interpolation filter is scaled by 2{circumflex over ( )}y, wherein x and y are each an integer, the generating of the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by applying the N-tap interpolation filter may include generating the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by performing de-scaling on a value to which the N-tap interpolation filter is applied, based on a de-scaling bit number, the de-scaling bit number may be based on a bit depth of a sample, x, and y, and the de-scaling may include bit-shifting to right by the de-scaling bit number.

According to another aspect of the present disclosure, a video decoding apparatus includes: an obtainer configured to obtain, from a bitstream, motion prediction mode information regarding a current block in a current picture, and when the obtained motion prediction mode information indicates a bi-directional motion prediction mode, obtain, from the bitstream, a first motion vector indicating a first reference block of the current block in a first reference picture and a second motion vector indicating a second reference block of the current block in a second reference picture; and an inter predictor configured to generate a pixel value of a first pixel from among pixels of the first reference block indicated by the first motion vector and a pixel value of a second pixel from among pixels of the second reference block indicated by the second motion vector by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel, generate a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region and the second neighboring region, and generate a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel.

According to another aspect of the present disclosure, a video encoding method includes: determining a first reference block of a first reference picture corresponding to a current block in a current picture, and a second reference block of a second reference picture corresponding to the current block, and determining a first motion vector indicating the first reference block and a second motion vector indicating the second reference block; generating a pixel value of a first pixel from among pixels of the first reference block and a pixel value of a second pixel from among pixels of the second reference block, by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel; generating a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region of the first pixel and the second neighboring region of the second pixel, and generating a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel; and generating a bitstream including information about the first motion vector and the second motion vector and motion prediction mode information indicating that a motion prediction mode of the current block is a bi-directional motion prediction mode.

According to another aspect of the present disclosure, a video encoding apparatus includes: an inter predictor configured to determine a first reference block of a first reference picture corresponding to a current block in a current picture, and a second reference block of a second reference picture corresponding to the current block, determine a first motion vector indicating the first reference block and a second motion vector indicating the second reference block, generate a pixel value of a first pixel from among pixels of the first reference block and a pixel value of a second pixel from among pixels of the second reference block, by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel, generate a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region of the first pixel and the second neighboring region of the second pixel, and generate a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel; and a bitstream generator configured to generate a bitstream including information about the first motion vector and the second motion vector and motion prediction mode information indicating that a motion prediction mode of the current block is a bi-directional motion prediction mode.

According to another aspect of the present disclosure, a computer-readable recording medium has recorded thereon a program for executing a method according to various embodiments.

Advantageous Effects of Disclosure

According to various embodiments, encoding and decoding efficiency may be increased by performing inter prediction on a current block by using a gradient value of a reference block of a reference picture in a bi-directional motion prediction mode to predict a value similar to that of an original block of the current block.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1A is a block diagram of a video decoding apparatus according to various embodiments.

FIG. 1B is a flowchart of a video decoding method according to various embodiments.

FIG. 1C is a block diagram of a video encoding apparatus according to various embodiments.

FIG. 1D is a flowchart of a video encoding method according to various embodiments.

FIG. 1E is a block diagram of an image decoder according to various embodiments.

FIG. 1F is a block diagram of an image encoder according to various embodiments.

FIG. 2 is a reference diagram for describing block-based bi-directional motion prediction and compensation processes, according to an embodiment.

FIGS. 3A through 3C are reference diagrams for describing processes of performing pixel unit motion compensation, according to embodiments.

FIG. 4 is a reference diagram for describing processes of calculating gradient values in horizontal and vertical directions, according to an embodiment.

FIG. 5 is a reference diagram for describing processes of calculating gradient values in horizontal and vertical directions, according to another embodiment.

FIGS. 6A and 6B are diagrams for describing processes of determining gradient values in horizontal and vertical directions by using one-dimensional (1D) filters, according to embodiments.

FIGS. 7A through 7E are tables showing filter coefficients of filters used to determine a pixel value at a fractional pixel position of a fractional pixel unit, and gradient values in horizontal and vertical directions, according to embodiments.

FIG. 8 is a reference diagram for describing processes of determining a horizontal direction displacement vector and a vertical direction displacement vector, according to an embodiment.

FIG. 9 is a diagram for describing processes of adding an offset value after filtering is performed, and determining a gradient value in a horizontal or vertical direction by performing inverse-scaling, according to an embodiment.

FIG. 10 illustrates processes of determining at least one coding unit as a current coding unit is split, according to an embodiment.

FIG. 11 illustrates processes of determining at least one coding unit when a coding unit having a non-square shape is split, according to an embodiment.

FIG. 12 illustrates processes of splitting a coding unit, based on at least one of a block shape information and split shape information, according to an embodiment.

FIG. 13 illustrates a method of determining a certain coding unit from among an odd number of coding units, according to an embodiment.

FIG. 14 illustrates an order of processing a plurality of coding units when the plurality of coding units are determined when a current coding unit is split, according to an embodiment.

FIG. 15 illustrates processes of determining that a current coding unit is split into an odd number of coding units when coding units are not processable in a certain order, according to an embodiment.

FIG. 16 illustrates processes of determining at least one coding unit when a first coding unit is split, according to an embodiment.

FIG. 17 illustrates that a shape into which a second coding unit is splittable is restricted when the second coding unit having a non-square shape determined when a first coding unit is split satisfies a certain condition, according to an embodiment.

FIG. 18 illustrates processes of splitting a coding unit having a square shape when split shape information is unable to indicate that a coding unit is split into four square shapes, according to an embodiment.

FIG. 19 illustrates that an order of processing a plurality of coding units may be changed according to processes of splitting a coding unit, according to an embodiment.

FIG. 20 illustrates processes of determining a depth of a coding unit as a shape and size of the coding unit are changed, when a plurality of coding units are determined when the coding unit is recursively split, according to an embodiment.

FIG. 21 illustrates a part index (PID) for distinguishing depths and coding units, which may be determined according to shapes and sizes of coding units, according to an embodiment.

FIG. 22 illustrates that a plurality of coding units are determined according to a plurality of certain data units included in a picture, according to an embodiment.

FIG. 23 illustrates a processing block serving as a criterion of determining a determination order of reference coding units included in a picture, according to an embodiment.

BEST MODE

According to an aspect of the present disclosure, a video decoding method includes: obtaining, from a bitstream, motion prediction mode information regarding a current block in a current picture; when the obtained motion prediction mode information indicates a bi-directional motion prediction mode, obtaining, from the bitstream, a first motion vector indicating a first reference block of the current block in a first reference picture and a second motion vector indicating a second reference block of the current block in a second reference picture; generating a pixel value of a first pixel from among pixels of the first reference block indicated by the first motion vector and a pixel value of a second pixel from among pixels of the second reference block indicated by the second motion vector by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel; generating a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region and the second neighboring region; and generating a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel.

According to another aspect of the present disclosure, a video decoding apparatus includes: an obtainer configured to obtain, from a bitstream, motion prediction mode information regarding a current block in a current picture, and when the obtained motion prediction mode information indicates a bi-directional motion prediction mode, obtain, from the bitstream, a first motion vector indicating a first reference block of the current block in a first reference picture and a second motion vector indicating a second reference block of the current block in a second reference picture; and an inter predictor configured to generate a pixel value of a first pixel from among pixels of the first reference block indicated by the first motion vector and a pixel value of a second pixel from among pixels of the second reference block indicated by the second motion vector by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel, generate a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region and the second neighboring region, and generate a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel.

According to another aspect of the present disclosure, a video encoding method includes: determining a first reference block of a first reference picture corresponding to a current block in a current picture, and a second reference block of a second reference picture corresponding to the current block, and determining a first motion vector indicating the first reference block and a second motion vector indicating the second reference block; generating a pixel value of a first pixel from among pixels of the first reference block and a pixel value of a second pixel from among pixels of the second reference block, by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel; generating a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region of the first pixel and the second neighboring region of the second pixel, and generating a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel; and generating a bitstream including information about the first motion vector and the second motion vector and motion prediction mode information indicating that a motion prediction mode of the current block is a bi-directional motion prediction mode.

According to another aspect of the present disclosure, a video encoding apparatus includes: an inter predictor configured to determine a first reference block of a first reference picture corresponding to a current block in a current picture, and a second reference block of a second reference picture corresponding to the current block, determine a first motion vector indicating the first reference block and a second motion vector indicating the second reference block, generate a pixel value of a first pixel from among pixels of the first reference block and a pixel value of a second pixel from among pixels of the second reference block, by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel, generate a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region of the first pixel and the second neighboring region of the second pixel, and generate a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel; and a bitstream generator configured to generate a bitstream including information about the first motion vector and the second motion vector and motion prediction mode information indicating that a motion prediction mode of the current block is a bi-directional motion prediction mode.

According to another aspect of the present disclosure, a computer-readable recording medium has recorded thereon a program for executing a method according to various embodiments.

MODE OF DISCLOSURE

Hereinafter, an ‘image’ may denote a still image of a video, or a moving image, i.e., a video itself.

Hereinafter, a ‘sample’ denotes data that is assigned to a sampling location of an image and is to be processed. For example, pixels in an image of a spatial domain may be samples.

Hereinafter, a ‘current block’ may denote a block of an image to be encoded or decoded.

FIG. 1A is a block diagram of a video decoding apparatus according to various embodiments.

A video decoding apparatus 100 according to various embodiments includes an obtainer 105 and an inter predictor 110.

The obtainer 105 receives a bitstream including information about a prediction mode of a current block, information indicating a motion prediction mode of the current block, and information about a motion vector.

The obtainer 105 may obtain, from the received bitstream, the information about the prediction mode of the current block, the information indicating the motion prediction mode of the current block, and the information about the motion vector. Also, the obtainer 105 may obtain, from the bitstream, a reference picture index indicating a reference picture from among previously decoded pictures.

When the prediction mode of the current block is an inter prediction mode, the inter predictor 110 performs inter prediction on the current block. In other words, the inter predictor 110 may generate a prediction pixel value of the current block by using at least one of pictures decoded before a current picture including the current block. For example, when the motion prediction mode of the current block is a bi-directional motion prediction mode, the inter predictor 110 may generate the prediction pixel value of the current block by using two pictures decoded before the current picture. In other words, when the information about the motion prediction mode obtained from the bitstream indicates the bi-directional motion prediction mode, the inter predictor 110 may generate the prediction pixel value of the current block by using the two pictures decoded before the current picture.

The inter predictor 110 may include a block unit motion compensator 115 and a pixel unit motion compensator 120.

The block unit motion compensator 115 may perform motion compensation on the current block, in block units. The block unit motion compensator 115 may determine at least one reference picture from the previously decoded pictures, by using a reference picture index obtained from the bitstream. Here, the reference picture index may denote a reference picture index with respect to each of prediction directions including an L0 direction and an L1 direction. Here, the reference picture index with respect to the L0 direction may denote an index indicating a reference picture among pictures included in an L0 reference picture list, and the reference picture index with respect to the L1 direction may denote an index indicating a reference picture among pictures included in an L1 reference picture list.

The block unit motion compensator 115 may determine a reference block of the current block, the reference block positioned in the at least one reference picture by using the information about the motion vector received from the bitstream. Here, a corresponding block that corresponds to the current block may be the reference block.

In other words, the block unit motion compensator 115 may determine the reference block of the current block by using the motion vector indicating the reference block from the current block.

Here, the motion vector denotes a vector indicating displacement of reference coordinates of the current block in the current picture and reference coordinates of the reference block in the reference picture. For example, when upper left coordinates of the current block are (1, 1) and upper left coordinates of the reference block in the reference picture are (3, 3), the motion vector may be (2, 2).

Here, the information about the motion vector may include a differential value of the motion vector, and the block unit motion compensator 115 may reconstruct the motion vector by using a predictor of the motion vector and the differential value of the motion vector obtained from the bitstream, and determine the reference block of the current block positioned in the at least one reference picture by using the reconstructed motion vector. Here, the differential value of the motion vector may denote a differential value of a motion vector with respect to a reference picture related to each of the prediction directions including the L0 direction and the L1 direction. Here, the differential value of the motion vector with respect to the L0 direction may denote a differential value of a motion vector indicating the reference block in the reference picture included in the L0 reference picture list, and the differential value of the motion vector with respect to the L1 direction may denote a differential value of a motion vector indicating the reference block in the reference picture included in the L1 reference picture list.

The block unit motion compensator 115 may perform motion compensation on the current block in block units, by using a pixel value of the reference block. The block unit motion compensator 115 may perform motion compensation on the current block in block units, by using a pixel value of a reference pixel in the reference block corresponding to a current pixel in the current block. Here, the reference pixel may be a pixel included in the reference block, and a corresponding pixel that corresponds to the current pixel in the current block may be the reference pixel.

The block unit motion compensator 115 may perform motion compensation on the current block in block units, by using a plurality of reference blocks respectively included in a plurality of reference pictures. For example, when the motion prediction mode of the current block is the bi-directional motion prediction mode, the block unit motion compensator 115 may determine two reference pictures from among the previously encoded pictures, and determine two reference blocks included in the two reference pictures.

The block unit motion compensator 115 may perform motion compensation on the current block in block units, by using pixel values of two reference pixels in the two reference blocks. The block unit motion compensator 115 may generate a motion compensation value in block units by performing the motion compensation on the current block in block units, by using an average value or a weighted sum of the pixel values of the two reference pixels.

A reference position of the reference block may be a position of an integer pixel, but is not limited thereto, and may be a position of a fractional pixel. Here, the integer pixel may denote a pixel in which a position component is an integer, and may be a pixel at an integer pixel position. The fractional pixel may denote a pixel in which a position component is a fraction, and may be a pixel at a fractional pixel position.

For example, when the upper left coordinates of the current block are (1, 1) and the motion vector is (2.5, 2.5), the upper left coordinates of the reference block in the reference picture may be (3.5, 3.5). Here, the position of the fractional pixel may be determined in ¼ pel or 1/16 pel units, wherein pel denotes a pixel element. Alternatively, the position of the fractional pixel may be determined in various fractional pel units.

When the reference position of the reference block is the position of the fractional pixel, the block unit motion compensator 115 may generate a pixel value of a first pixel from among pixels of a first reference block indicated by a first motion vector and a pixel value of a second pixel from among pixels of a second reference block indicated by a second motion vector, by applying an interpolation filter to a first neighboring region including the first pixel and a second neighboring region including the second pixel.

In other words, the pixel value of the reference pixel in the reference block may be determined by using pixel values of neighboring pixels in which a component in a certain direction is an integer. Here, the certain direction may be a horizontal direction or a vertical direction.

For example, the block unit motion compensator 115 may determine, as the pixel value of the reference pixel, a value obtained by performing filtering on pixel values of pixels, in which a component in a certain direction is an integer, by using an interpolation filter, and determine a motion compensation value in block units with respect to the current block, by using the pixel value of the reference pixel. A motion compensation value in block units by using an average value or a weighted sum of reference pixels. Here, the interpolation filter may be a discrete cosine transform (DCT)-based M-tap interpolation filter. A coefficient of the DCT-based M-tap interpolation filter may be induced from DCT and inverse DCT (IDCT). Here, the coefficient of the interpolation filter may be a filter coefficient scaled to an integer coefficient so as to reduce real number operations during the filtering. Here, the interpolation filter may be a one-dimensional (1D) interpolation filter in a horizontal or vertical direction. For example, when a position of a pixel is expressed in x, y orthogonal coordinate components, the horizontal direction may be a direction parallel to an x-axis. The vertical direction may be a direction parallel to a y-axis.

The block unit motion compensator 115 may first perform filtering with respect to pixel values of pixels at an integer position by using the 1D interpolation filter in the vertical direction, and then perform filtering with respect to a value generated via the filtering by using the 1D interpolation filter in the horizontal direction to determine the pixel value of the reference pixel at the fractional pixel position.

Meanwhile, the value generated via the filtering when a scaled filter coefficient is used may be higher than a value generated via filtering when an un-scaled filter is used. Accordingly, the block unit motion compensator 115 may perform de-scaling with respect to the value generated via the filtering.

The block unit motion compensator 115 may perform the de-scaling after performing filtering on the pixel values of the pixels at the integer position by using the 1D interpolation filter in the vertical direction. Here, the de-scaling may include bit-shifting to the right by a de-scaling bit number. The de-scaling bit number may be determined based on a bit depth of a sample of an input image. For example, the de-scaling bit number may be a value obtained by subtracting 8 from the bit depth of the sample.

Also, the block unit motion compensator 115 may perform the filtering with respect to the pixel values of the pixels at the integer position by using the 1D interpolation filter in the vertical direction, and perform the filtering with respect to the value generated via the filtering by using the 1D interpolation filter in the horizontal direction, and then perform the de-scaling. Here, the de-scaling may include bit-shifting to the right by a de-scaling bit number. The de-scaling bit number may be determined based on a scaling bit number of the 1D interpolation filter in the vertical direction, a scaling bit number of the 1D interpolation filter in the horizontal direction, and the bit depth of the sample. For example, when the scaling bit number p of the 1D interpolation filter in the vertical direction is 6, the scaling bit number q of the 1D interpolation filter in the horizontal direction is 6, and the bit depth of the sample is b, the de-scaling bit number may be p+q+8−b, i.e., 20−b.

When the block unit motion compensator 115 performs only bit-shifting to the right by a de-scaling bit number after performing filtering with respect to a pixel, in which a component in a certain direction is an integer, by using a 1D interpolation filter, a round-off error may be generated, and thus the block unit motion compensator 115 may perform the de-scaling after performing the filtering with respect to the pixel, in which the component in the certain direction is the integer, by using the 1D interpolation filter, and then adding an offset value. Here, the offset value may be 2{circumflex over ( )}(de-scaling bit number−1).

The pixel unit motion compensator 120 may generate a motion compensation value in pixel units by performing motion compensation on the current block in pixel units. When the motion prediction mode of the current block is the bi-directional motion prediction mode, the pixel unit motion compensator 120 may generate the motion compensation value in pixel units by performing motion compensation on the current block in pixel units.

The pixel unit motion compensator 120 may generate the motion compensation value in pixel units by performing the motion compensation on the current block in pixel units, based on an optical flow of the pixels of the first reference picture and second reference picture. The optical flow will be described later with reference to FIG. 3A.

The pixel unit motion compensator 120 may generate the motion compensation value in pixel units by performing the motion compensation in pixel units with respect to pixels included in the reference block of the current block.

The pixel unit motion compensator 120 may determine the reference pixel in the reference block, which corresponds to the current pixel of the current block, and determine a gradient value of the reference pixel.

The pixel unit motion compensator 120 may generate the motion compensation value in pixel units by performing the motion compensation in pixel units with respect to the current block by using the gradient value of the reference pixel.

The pixel unit motion compensator 120 may generate a gradient value of the first pixel from among pixels of the first reference block indicated by the first motion vector and a gradient value of the second pixel from among pixels of the second reference block indicated by the second motion vector, by applying a filter to a first neighboring region of the first pixel including the first pixel and a second neighboring region of the second pixel including the second pixel.

The pixel unit motion compensator 120 may determine pixel values and gradient values of pixels in a first window having a certain size and including the first pixel around the first pixel in the first reference picture, and determine pixel values and gradient values of pixels in a second window having a certain size and including the second pixel around the second pixel in the second reference picture.

The pixel unit motion compensator 120 may determine a displacement vector per unit time with respect to the current pixel, by using the pixel values and gradient values of the pixels in the first window and the pixel values and gradient values of the pixels in the second window.

The pixel unit motion compensator 120 may perform the motion compensation on the current block in pixel units, by using the displacement vector per unit time with respect to the current pixel and the gradient value of the reference pixel.

A reference position of the reference block may be an integer pixel position, but alternatively, may be a fractional pixel position.

When the reference position of the reference block is the fractional pixel position, the gradient value of the reference pixel in the reference block may be determined by using pixel values of neighboring pixels, in which a component in a certain direction is an integer.

For example, the pixel unit motion compensator 120 may determine, as the gradient value of the reference pixel, a result value obtained by performing filtering on the pixel values of the neighboring pixels, in which the component in the certain direction is an integer, by using a gradient filter. Here, a filter coefficient of the gradient filter may be determined by using a coefficient pre-determined with respect to a DCT-based interpolation filter. The filter coefficient of the gradient filter may be a filter coefficient scaled to an integer coefficient so as to reduce real number operations during the filtering.

Here, the gradient filter may be a 1D gradient filter in a horizontal or vertical direction.

The pixel unit motion compensator 120 may perform filtering on a neighboring pixel, in which a component in a corresponding direction is an integer, by using the 1D gradient filter in the horizontal or vertical direction, so as to determine a gradient value of the reference pixel in the horizontal or vertical direction.

For example, the pixel unit motion compensator 120 may determine the gradient value of the reference pixel in the horizontal direction by performing filtering on a pixel positioned in a horizontal direction from a pixel, in which a horizontal direction component is an integer, from among pixels adjacent to the reference pixel, by using the 1D gradient filter in the horizontal direction.

When the position of the reference pixel is (x+α, y+β), wherein x and y are each an integer and α and β are each a fraction, the pixel unit motion compensator 120 may determine, as a pixel value at a (x, y+β) position, a result value obtained by performing filtering on a pixel at a (x, y) position and a pixel, in which a vertical component is an integer, from among pixels positioned in the vertical direction from the pixel at the (x, y) position, by using the 1D interpolation filter.

The pixel unit motion compensator 120 may determine, as a gradient value at a (x+α, y+β) position in the horizontal direction, a result value obtained by performing filtering on the pixel value at the (x, y+β) position and pixel values of pixels, in which a horizontal component is an integer, from among pixels positioned in the horizontal direction from the pixel at) the (x, y+β) position, by using the 1D gradient filter in the horizontal direction.

An order of using the 1D gradient filter and the 1D interpolation filter is not limited. In the above description, an interpolation filtering value in a vertical direction is first generated by performing filtering on a pixel at an integer position by using a 1D interpolation filter in the vertical direction, and then filtering is performed on the interpolation filtering value in the vertical direction by using a 1D gradient filter in a horizontal direction, but alternatively, an interpolation filtering value in the horizontal direction may be generated first by performing filtering on the pixel at the integer position by using the 1D gradient filter in the horizontal direction, and then filtering may be performed on the interpolation filtering value in the horizontal direction by using the 1D interpolation filter in the vertical direction.

Hereinabove, the pixel unit motion compensator 120 determining a gradient value in a horizontal direction at a (x+α, y+β) position has been described in detail. Since the pixel unit motion compensator 120 determines a gradient value in a vertical direction at a (x+α, y+β) position in the similar manner as determining of a gradient value in a horizontal direction, details thereof are not provided again.

Hereinabove, the pixel unit motion compensator 120 using a 1D gradient filter and a 1D interpolation filter so as to determine a gradient value at a fractional pixel position has been described in detail. However, alternatively, a gradient filter and an interpolation filter may be used to determine a gradient value at an integer pixel position. However, in case of an integer pixel, a pixel value may be determined without using an interpolation filter, but the pixel value of the integer pixel may be determined by performing filtering on the integer pixel and a neighboring pixel, in which a component in a certain direction is an integer, by using an interpolation filter, for processes consistent with processes in a fractional pixel. For example, an interpolation filter coefficient in an integer pixel may be {0, 0, 64, 0, 0}, and since an interpolation filter coefficient related to a neighboring integer pixel is 0, filtering may be performed by only using a pixel value of a current integer pixel, and as a result, filtering may be performed on the current integer pixel and a neighboring integer pixel by using an interpolation filter to determine the pixel value of the current integer pixel.

The pixel unit motion compensator 120 may perform de-scaling after performing filtering on a pixel at an integer position by using a 1D interpolation filter in a vertical direction. Here, the de-scaling may include bit-shifting to the right by a de-scaling bit number. The de-scaling bit number may be determined based on a bit depth of a sample. For example, the de-scaling bit number may be a value obtained by subtracting 8 from the bit depth of the sample.

The pixel unit motion compensator 120 may perform de-scaling after performing filtering on a value generated by performing the de-scaling by using a gradient filter in a horizontal direction. Likewise here, the de-scaling may include bit-shifting to the right by the de-scaling bit number. The de-scaling bit number may be determined based on a scaling bit number of a 1D interpolation filter in a vertical direction, a scaling bit number of a 1D gradient filter in a horizontal direction, and a bit depth of a sample. For example, when the scaling bit number p of the 1D interpolation filter in the vertical direction is 6, the scaling bit number q of the 1D gradient filter in the horizontal direction is 4, and the bit depth of the sample is b, the de-scaling bit number may be p+q+8−b, i.e., 18−b.

When the pixel unit motion compensator 120 performs only bit-shifting to the right by a de-scaling bit number on a value generated via filtering after performing the filtering, a round-off error may be generated, and thus the pixel unit motion compensator 120 may perform the de-scaling after adding an offset value to the value generated via the filtering. Here, the offset value may be 2{circumflex over ( )}(de-scaling bit number−1).

The inter predictor 110 may generate the prediction pixel value of the current block by using the motion compensation value in block units and the motion compensation value in pixel units with respect to the current block. For example, the inter predictor 110 may generate the prediction pixel value of the current block by adding the motion compensation value in block units and the motion compensation value in pixel units with respect to the current block. Here, the motion compensation value in block units may denote a value generated by performing motion compensation in block units, and the motion compensation value in pixel units denote a value generated by performing motion compensation in pixel units, wherein the motion compensation value in block units may be an average value or weighted sum of the reference pixel, and the motion compensation value in pixel units may be a value determined based on the displacement vector related to the current pixel and the gradient value of the reference pixel.

The video decoding apparatus 100 may obtain a residual block of the current block from the bitstream, and reconstruct the current block by using the residual block and the prediction pixel value of the current block. For example, the video decoding apparatus 100 may determine, from the bitstream, a pixel value of a reconstructed block by adding a pixel value of the residual block of the current block and the prediction pixel value of the current block.

The video decoding apparatus 100 may include an image decoder (not shown), wherein the image decoder may include the obtainer 105 and the inter predictor 110. The image decoder will be described below with reference to FIG. 1E.

FIG. 1B is a flowchart of a video decoding method according to various embodiments.

In operation S105, the video decoding apparatus 100 may obtain, from a bitstream, motion prediction mode information with respect to a current block in a current picture. The video decoding apparatus 100 may receive the bitstream including the motion prediction mode information with respect to the current block in the current picture, and obtain the motion prediction mode information with respect to the current block from the received bitstream.

The video decoding apparatus 100 may obtain, from the bitstream, information about a prediction mode of the current block, and determine the prediction mode of the current block based on the information about the prediction mode of the current block. Here, when the prediction mode of the current block is an inter prediction mode, the video decoding apparatus 100 may obtain the motion prediction mode information with respect to the current block.

For example, the video decoding apparatus 100 may determine the prediction mode of the current block to be the inter prediction mode, based on the information about the prediction mode of the current block. When the prediction mode of the current block is the inter prediction mode, the video decoding apparatus 100 may obtain the motion prediction mode information with respect to the current block from the bitstream.

In operation S110, when the motion prediction mode information indicates a bi-directional motion prediction mode, the video decoding apparatus 100 may obtain, from the bitstream, a first motion vector indicating a first reference block of the current block in a first reference picture and a second motion vector indicating a second reference block of the current block in a second reference picture.

In other words, the video decoding apparatus 100 may obtain the bitstream including information about the first and second motion vectors, and obtain the first and second motion vectors from the received bitstream. The video decoding apparatus 100 may obtain a reference picture index from the bitstream, and determine the first and second reference pictures from among previously decoded pictures based on the reference picture index.

In operation S115, the video decoding apparatus 100 may generate a pixel value of a first pixel from among pixels of the first reference block indicated by the first motion vector and a pixel value of a second pixel from among pixels of the second reference block indicated by the second motion vector, by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel.

In operation S120, the video decoding apparatus 100 may generate a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to the first neighboring region and the second neighboring region. Here, the filter may be a 1D filter, and may include a gradient filter and an interpolation filter.

In operation S125, the video decoding apparatus 100 may generate a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel.

The video decoding apparatus 100 may obtain a residual signal regarding the current block from the bitstream, and reconstruct the current block by using the residual signal and the prediction pixel value of the current block. In other words, the video decoding apparatus 100 may generate a pixel value of a reconstructed block of the current block by adding the prediction pixel value of the current block and a residual pixel value of the current block indicated by the residual signal.

FIG. 1C is a block diagram of a video encoding apparatus according to various embodiments.

A video encoding apparatus 150 according to various embodiments includes an inter predictor 155 and a bitstream generator 170.

The inter predictor 155 performs inter prediction on a current block. In other words, when a prediction mode of the current block is an inter prediction mode, the inter predictor 155 may generate a prediction pixel value of the current block by using at least one of pictures encoded before a current picture included in the current block.

The inter predictor 155 may include a block unit motion compensator 160 and a pixel unit motion compensator 165.

The block unit motion compensator 160 may generate a motion compensation value in block units by performing motion compensation on the current block in block units.

The block unit motion compensator 160 may determine at least one reference picture from among previously encoded pictures, and determine a reference block of the current block positioned in the at least one reference picture.

The block unit motion compensator 160 may generate the motion compensation value in block units by performing the motion compensation on the current block in block units, by using a pixel value of the reference block. The block unit motion compensator 160 may generate the motion compensation value in block units by performing the motion compensation on the current block in block units by using a reference pixel value of the reference block, which corresponds to a current pixel of the current block.

The block unit motion compensator 160 may generate the motion compensation value in block units by performing the motion compensation on the current block in block units, by using a plurality of reference blocks respectively included in a plurality of reference pictures. For example, when a motion prediction mode of the current block is a bi-directional prediction mode, the block unit motion compensator 160 may determine two reference pictures from among the previously encoded pictures, and determine two reference blocks included in the two reference pictures. Here, bi-directional prediction does not only mean that inter prediction is performed by using a picture displayed before the current picture and a picture displayed after the current picture, but may also mean that inter prediction is performed by using two pictures encoded before the current picture regardless of an order of being displayed.

The block unit motion compensator 160 may generate the motion compensation value in block units by performing the motion compensation on the current block in block units by using pixel values of two reference pixels in the two reference blocks. The block unit motion compensator 160 may generate the motion compensation value in block units by performing the motion compensation on the current block in block units, by using an average pixel value or weighted sum of the two reference pixels.

The block unit motion compensator 160 may output a reference picture index indicating a reference picture for motion compensation of the current block, from among the previously encoded pictures.

The block unit motion compensator 160 may determine a motion vector having the current block as a start point and the reference block of the current block as an end point, and output the motion vector. The motion vector may denote a vector indicating displacement of reference coordinates of the current block in the current picture and reference coordinates of the reference block in the reference picture. For example, when coordinates of an upper left corner of the current block are (1, 1) and upper left coordinates of the reference block in the reference picture are (3, 3), the motion vector may be (2, 2).

A reference position of the reference block may be a position of an integer pixel, but alternatively, may be a position of a fractional pixel. Here, the position of the fractional pixel may be determined in ¼ pel or 1/16 pel units. Alternatively, the position of the fractional pixel may be determined in various fractional pel units.

For example, when the reference position of the reference block is (1.5, 1.5) and the coordinates of the upper left corner of the current block are (1, 1), the motion vector may be (0.5, 0.5). When the motion vector is determined in ¼ or 1/16 pel units to indicate the reference position of the reference block, which is a position of a fractional pixel, a motion vector of an integer is determined by scaling the motion vector, and the reference position of the reference block may be determined by using the up-scaled motion vector. When the reference position of the reference block is a position of a fractional pixel, a position of the reference pixel of the reference block may also be a position of a fractional pixel. Accordingly, a pixel value at a fractional pixel position in the reference block may be determined by using pixel values of neighboring pixels, in which a component in a certain direction is an integer.

For example, the block unit motion compensator 160 may determine, as the pixel value of the reference pixel at the fractional pixel position, a value obtained by performing filtering on pixel values of neighboring pixels, in which a component in a certain direction is an integer, by using an interpolation filter, and determine the motion compensation value in block units with respect to the current block, by using the pixel value of the reference pixel. Here, the interpolation filter may be a DCT-based M-tap interpolation filter. A coefficient of the DCT-based M-tap interpolation filter may be induced from DCT and IDCT. Here, the coefficient of the interpolation filter may be a filter coefficient scaled to an integer coefficient so as to reduce real number operations during the filtering.

Here, the interpolation filter may be a 1D interpolation filter in a horizontal or vertical direction.

The block unit motion compensator 160 may first perform filtering with respect to neighboring integer pixels by using a 1D interpolation filter in a vertical direction, and then perform filtering with respect to a value on which the filtering is performed, by using a 1D interpolation filter in a horizontal direction to determine the pixel value of the reference pixel at the fractional pixel position. When a scaled filter coefficient is used, the block unit motion compensator 160 may perform de-scaling on a value on which filtering is performed, after performing filtering on a pixel at an integer position by using the 1D interpolation filter in the vertical direction. Here, the de-scaling may include bit-shifting to the right by a de-scaling bit number. The de-scaling bit number may be determined based on a bit depth of a sample. For example, the de-scaling bit number may be a value obtained by subtracting 8 from the bit depth of the sample.

Also, the block unit motion compensator 160 may perform filtering on a pixel, in which a horizontal direction component is an integer, by using the 1D interpolation filter in the vertical direction, and then perform the bit-shifting to the right by the de-scaling bit number. The de-scaling bit number may be determined based on a scaling bit number of the 1D interpolation filter in the vertical direction, a scaling bit number of the 1D interpolation filter in the horizontal direction, and the bit depth of the sample.

When the block unit motion compensator 160 performs only bit-shifting to the right by a de-scaling bit number, a round-off error may be generated, and thus the block unit motion compensator 160 may perform filtering on a pixel, in which a component in a certain direction is an integer, by using a 1D interpolation filter in the certain direction, add an offset value to a value on which the filtering is performed, and then perform de-scaling on a value to which the offset value is added. Here, the offset value may be 2{circumflex over ( )}(de-scaling bit number−1).

Hereinabove, determining of a de-scaling bit number based on a bit depth of a sample after filtering using a 1D interpolation filter in a vertical direction has been described, but alternatively, the de-scaling bit number may be determined not only the bit depth of the sample, but also a bit number scaled with respect to an interpolation filter coefficient. In other words, the de-scaling bit number may be determined based on the bit depth of the sample and the bit number scaled with respect to the interpolation coefficient, within a range that overflow does not occur, while considering a size of a register used during filtering and a size of a buffer storing a value generated during the filtering.

The pixel unit motion compensator 165 may generate a motion compensation value in pixel units by performing motion compensation on the current block in pixel units. For example, when the motion prediction mode is a bi-directional motion prediction mode, the pixel unit motion compensator 165 may generate the motion compensation value in pixel units by performing the motion compensation on the current block in pixel units.

The pixel unit motion compensator 165 may generate the motion compensation value in pixel units by performing the motion compensation on the current block in pixel units, by using gradient values of pixels included in the reference block of the current block.

The pixel unit motion compensator 165 may generate a gradient value of a first pixel from among pixels of a first reference block in a first reference picture and a gradient value of a second pixel from among pixels of a second reference block in a second reference picture by applying a filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel.

The pixel unit motion compensator 165 may determine pixel values and gradient values of pixels in a first window having a certain size and including the first reference pixel around the first reference pixel in the first reference picture, and determine pixel values and gradient values of pixels in a second window having a certain size and including the second reference pixel around the second reference pixel in the second reference picture. The pixel unit motion compensator 165 may determine a displacement vector per unit time with respect to the current pixel by using the pixel values and gradient values of the pixels in the first window and the pixel values and gradient values of the pixels in the second window.

The pixel unit motion compensator 165 may generate the motion compensation value in pixel units by performing the motion compensation on the current block in pixel units, by using the displacement vector per unit time and a gradient value of the reference pixel.

A position of the reference pixel may be a position of an integer pixel, but alternatively, may be a position of a fractional pixel.

When a reference position of the reference block is a position of a fractional pixel, the gradient value of the reference pixel in the reference block may be determined by using pixel values of neighboring pixels, in which a component in a certain direction is an integer.

For example, the pixel unit motion compensator 165 may determine, as the gradient value of the reference pixel, a result value obtained by performing filtering on the pixel values of the neighboring pixels, in which a component in a certain direction is an integer, by using a gradient filter. Here, a filter coefficient of the gradient filter may be determined by using a coefficient pre-determined with respect to a DCT-based interpolation filter.

The filter coefficient of the gradient filter may be a filter coefficient scaled to an integer coefficient so as to reduce real number operations during the filtering. Here, the gradient filter may be a 1D gradient filter in a horizontal or vertical direction.

The pixel unit motion compensator 165 may perform filtering on a neighboring pixel, in which a component in a corresponding direction is an integer, by using a 1D gradient filter in a horizontal or vertical direction, so as to determine a gradient value of the reference pixel in the horizontal or vertical direction.

For example, the pixel unit motion compensator 165 may determine a pixel value of a pixel, in which a vertical component is a fraction, by performing filtering on pixels, in which a vertical component is an integer, from among pixels in a vertical direction from an integer pixel adjacent to a reference pixel, by using a 1D interpolation filter in the vertical direction.

With respect to a pixel positioned in another column adjacent to the integer pixel adjacent to the reference pixel, the pixel unit motion compensator 165 may determine a pixel value of a fractional pixel position positioned in the other column by performing filtering on a neighboring integer pixel in the vertical direction, by using the 1D interpolation filter in the vertical direction. Here, a position of the pixel positioned in the other column may be a position of a fractional pixel in the vertical direction and a position of an integer pixel in the horizontal direction.

In other words, when the position of the reference pixel is (x+α, y+β), wherein x and y are each an integer and α and β are each a fraction, the pixel unit motion compensator 165 may determine a pixel value at a (x, y+β) position by performing filtering on a neighboring integer pixel in the vertical direction from a (x, y) position by using an interpolation filter in the vertical direction.

The pixel unit motion compensator 165 may determine a gradient value at a (x+α, y+β) position in the horizontal direction by performing filtering on the pixel value at the (x, y+β) position and a pixel value of a pixel, in which a horizontal component is an integer, from among pixels positioned in the horizontal direction from the pixel value at the (x, y+β) position, by using a gradient filter in the horizontal direction.

An order of using the 1D gradient filter and the 1D interpolation filter is not limited. As described above, an interpolation filtering value in a vertical direction may be first generated by performing filtering on a pixel at an integer position by using a 1D interpolation filter in the vertical direction, and then filtering may be performed on the interpolation filtering value in the vertical direction by using a 1D gradient filter in a horizontal direction, but alternatively, a gradient filtering value in the horizontal direction may be generated first by performing filtering on the pixel at the integer position by using the 1D gradient filter in the horizontal direction, and then filtering may be performed on the gradient filtering value in the horizontal direction by using the 1D interpolation filter in the vertical direction.

Hereinabove, the pixel unit motion compensator 165 determining a gradient value in a horizontal direction at a (x+α, y+β) position has been described in detail.

The pixel unit motion compensator 165 may determine a gradient value in a vertical direction at a (x+α, y+β) position in the similar manner as determining of a gradient value in a horizontal direction.

The pixel unit motion compensator 165 may determine a gradient value of a reference pixel in a vertical direction by performing filtering on a neighboring integer pixel in the vertical direction from integer pixels adjacent to the reference pixel, by using a 1D gradient filter in the vertical direction. Also with respect to a pixel adjacent to the reference pixel and positioned in another column, the pixel unit motion compensator 165 may determine a gradient value in the vertical direction with respect to the pixel adjacent to the reference pixel and positioned in the other column by performing filtering on a neighboring integer pixel in the vertical direction, by using the 1D gradient filter in the vertical direction. Here, a position of the pixel may be a position of a fractional pixel in the vertical direction and a position of an integer pixel in a horizontal direction.

In other words, when a position of a reference pixel is (x+α, y+β), wherein x and y are each an integer, and α and β are each a fraction, the pixel unit motion compensator 165 may determine a gradient value in a vertical direction at a (x, y+β) position by performing filtering on a neighboring integer pixel in the vertical direction from a (x, y) position, by using a gradient filter in the vertical direction.

The pixel unit motion compensator 165 may determine a gradient value in a vertical direction at a (x+α, y+β) position by performing filtering on a gradient value at a (x, y+β) position and a gradient value of a neighboring integer pixel positioned in a horizontal direction from the (x, y+β) position, by using an interpolation filter in the horizontal direction.

An order of using the 1D gradient filter and the 1D interpolation filter is not limited. As described above, a gradient filtering value in a vertical direction may be first generated by performing filtering on pixels at an integer position by using a 1D gradient filter in the vertical direction, and then filtering may be performed on the gradient filtering value in the vertical direction by using a 1D interpolation filter in a horizontal direction, but alternatively, an interpolation filtering value in the horizontal direction may be generated first by performing filtering on the pixel at the integer position by using the 1D interpolation filter in the horizontal direction, and then filtering may be performed on the interpolation filtering value in the horizontal direction by using the 1D gradient filter in the vertical direction.

Hereinabove, the pixel unit motion compensator 165 using a gradient filter and an interpolation filter so as to determine a gradient value at a fractional pixel position has been described in detail. However, alternatively, a gradient filter and an interpolation filter may be used to determine a gradient value at an integer pixel position.

In case of an integer pixel, a pixel value may be determined without using an interpolation filter, but filtering may be performed on the integer pixel and a neighboring integer pixel by using an interpolation filter for processes consistent with processes in a fractional pixel. For example, an interpolation filter coefficient in an integer pixel may be {0, 0, 64, 0, 0}, and since an interpolation filter coefficient multiplied to the neighboring integer pixel is 0, filtering may be performed by only using a pixel value of a current integer pixel, and as a result, the pixel value of the current integer pixel may identically determined as a value generated by performing filtering on the current integer pixel and the neighboring integer pixel by using the interpolation filter.

Meanwhile, when a scaled filter coefficient is used, the pixel unit motion compensator 165 may perform filtering on a pixel at an integer position by using a 1D gradient filter in a horizontal direction, and then perform de-scaling on a value on which the filtering is performed. Here, the de-scaling may include bit-shifting to the right by a de-scaling bit number. The de-scaling bit number may be determined based on a bit depth of a sample. For example, the de-scaling bit number may be a value obtained by subtracting 8 from the bit depth of the sample.

The pixel unit motion compensator 165 may perform filtering on a pixel, in which a component in a vertical direction is an integer, by using an interpolation filter in the vertical direction, and then perform de-scaling. Here, the de-scaling may include bit-shifting to the right by a de-scaling bit number. The de-scaling bit number may be determined based on a scaling bit number of a 1D interpolation filter in the vertical direction, a scaling bit number of a 1D gradient filter in a horizontal direction, and the bit depth of the sample.

When the pixel unit motion compensator 165 performs only bit-shifting to the right by a de-scaling bit number, a round-off error may be generated. Thus, the pixel unit motion compensator 165 may perform filtering by using a 1D interpolation filter, add an offset value to a value on which the filtering is performed, and then perform de-scaling on a value to which the offset value is added. Here, the offset value may be 2{circumflex over ( )}(de-scaling bit number−1).

The inter predictor 155 may generate the prediction pixel value of the current block by using the motion compensation value in block units and the motion compensation value in pixel units with respect to the current block. For example, the inter predictor 155 may generate the prediction pixel value of the current block by adding the motion compensation value in block units and the motion compensation value in pixel units with respect to the current block. In particular, when the motion prediction mode of the current block is a bi-directional motion prediction mode, the inter predictor 155 may generate the prediction pixel value of the current block by using the motion compensation value in block units and the motion compensation value in pixel units with respect to the current block.

When the motion prediction mode of the current block is a uni-directional motion prediction mode, the inter predictor 155 may generate the prediction pixel value of the current block by using the motion compensation value in block units with respect to the current block. Here, a uni-direction denotes that one reference picture is used from among the previously encoded pictures. The one reference picture may be a picture displayed before the current picture, but alternatively, may be a picture displayed after the current picture.

The inter predictor 155 may determine the motion prediction mode of the current block, and output information indicating the motion prediction mode of the current block. For example, the inter predictor 155 may determine the motion prediction mode of the current block to be a bi-directional motion prediction mode, and output information indicating the bi-directional motion prediction mode. Here, the bi-directional motion prediction mode denotes a mode in which motion is predicted by using reference blocks in two decoded reference pictures.

The bitstream generator 170 may generate a bitstream including a motion vector indicating the reference block. The bitstream generator 170 may encode the motion vector indicating the reference block, and generate a bitstream including the encoded motion vector. The bitstream generator 170 may encode a differential value of the motion vector indicating the reference block, and generate a bitstream including the encoded differential value of the motion vector. Here, the differential value of the motion vector may denote a difference between the motion vector and a predictor of the motion vector. Here, the differential value of the motion vector may denote a differential value of a motion vector with respect to reference pictures respectively related to prediction directions including an L0 direction and an L1 direction. Here, the differential value of the motion vector with respect to the L0 direction may denote a differential value of a motion vector indicating a reference picture in a reference picture included in an L0 reference picture list, and the differential value of the motion vector with respect to the L1 direction may denote a differential value of a motion vector indicating a reference picture in a reference picture included in an L1 reference picture list.

Also, the bitstream generator 170 may generate the bitstream further including information indicating the motion prediction mode of the current block. The bitstream generator 170 may encode a reference picture index indicating the reference picture of the current block from among the previously encoded pictures, and generate a bitstream including the encoded reference picture index. Here, the reference picture index may denote a reference picture index with respect to each of prediction directions including an L0 direction and an L1 direction. Here, the reference picture index with respect to the L0 direction may denote an index indicating a reference picture among pictures included in an L0 reference picture list, and the reference picture index with respect to the L1 direction may denote an index indicating a reference picture among pictures included in an L1 reference picture list.

The video encoding apparatus 150 may include an image encoder (not shown), and the image encoder may include the inter predictor 155 and the bitstream generator 170. The video encoder will be described later with reference to FIG. 1F.

FIG. 1D is a flowchart of a video encoding method according to various embodiments.

Referring to FIG. 1D, in operation S150, the video encoding apparatus 150 may determine a first reference block of a first reference picture corresponding to a current block in a current picture and a second reference block of a second reference picture corresponding to the current block, and determine a first motion vector indicating the first reference block and a second motion vector indicating the second reference block.

In operation S155, the video encoding apparatus 150 may generate a pixel value of a first pixel among pixels of the first reference block and a pixel value of a second pixel among pixels of the second reference block, by applying an interpolation filter to a first neighboring region of the first pixel and a second neighboring region of the second pixel.

In operation S160, the video encoding apparatus 150 may generate a gradient value of the first pixel and a gradient value of the second pixel by applying a filter to a first neighboring region of the first pixel among the pixels of the first reference block and a second neighboring region of the second pixel among the second reference block, and generate a prediction pixel value of the current block by using the pixel value of the first pixel, the pixel value of the second pixel, the gradient value of the first pixel, and the gradient value of the second pixel.

In operation S165, the video encoding apparatus 150 may generate a bitstream including information about the first and second motion vectors, and motion prediction mode information indicating that a motion prediction mode of the current block is a bi-directional motion prediction mode.

The video encoding apparatus 150 may encode a residual signal of the current block, the residual signal indicating a difference between the prediction pixel value of the current block and an original block of the current block, and generate the bitstream further including the encoded residual signal. The video encoding apparatus 150 may encode information about a prediction mode of the current block and a reference picture index, and generate the bitstream further including the encoded information about the prediction mode and the encoded reference picture index. For example, the video encoding apparatus 150 may encode information indicating that the prediction mode of the current block is an inter prediction mode and a reference picture index indicating at least one picture from among previously decoded pictures, and generate the bitstream further including the encoded information about the prediction mode and the encoded reference picture index.

FIG. 1E is a block diagram of an image decoder 600 according to various embodiments.

The image decoder 600 according to various embodiments performs operations performed by the image decoder (not shown) of the video decoding apparatus 100 to decode image data.

Referring to FIG. 1E, an entropy decoder 615 parses encoded image data that is to be decoded, and encoding information required for decoding, from a bitstream 605. The encoded image data is a quantized transformation coefficient, and an inverse quantizer 620 and an inverse transformer 625 reconstructs residue data from the quantized transformation coefficient.

An intra predictor 640 performs intra prediction per block. An inter predictor 635 performs inter prediction by using a reference image obtained from a reconstructed picture buffer 630, per block. The inter predictor 635 of FIG. 1E may correspond to the inter predictor 110 of FIG. 1A.

Data in a spatial domain with respect to a block of a current image may be reconstructed by adding prediction data and the residue data of each block generated by the intra predictor 640 or the inter predictor 635, and a deblocking unit 645 and an SAO performer 650 may output a filtered reconstructed image by performing loop filtering on the reconstructed data in the spatial domain. Also, reconstructed images stored in the reconstructed picture buffer 630 may be output as a reference image.

In order for a decoder (not shown) of the video decoding apparatus 100 to decode image data, stepwise operations of the image decoder 600 according to various embodiments may be performed per block.

FIG. 1F is a block diagram of an image encoder according to various embodiments.

An image encoder 700 according to various embodiments performs operations performed by the image encoder (not shown) of the video encoding apparatus 150 to encode image data.

In other words, an intra predictor 720 performs intra prediction per block on a current image 705, and an inter predictor 715 performs inter prediction by using the current image 705 per block and a reference image obtained from a reconstructed picture buffer 710. Here, the inter predictor 715 of FIG. 1E may correspond to the inter predictor 155 of FIG. 1C.

Residue data may be generated by subtracting prediction data regarding each block output from the intra predictor 720 or the inter predictor 715 from data regarding an encoded block of the current image 705, and a transformer 725 and a quantizer 730 may output a transformation coefficient quantized per block by preforming transformation and quantization on the residue data. An inverse quantizer 745 and an inverse transformer 750 may reconstruct residue data in a spatial domain by performing inverse quantization and inverse transformation on the quantized transformation coefficient. The reconstructed residue data in the spatial domain may be added to the prediction data regarding each block output from the intra predictor 720 or the inter predictor 715 to be reconstructed as data in spatial domain regarding a block of the current image 705. A deblocking unit 755 and an SAO performer 760 generate a filtered reconstructed image by performing in-loop filtering on the reconstructed data in the spatial domain. The generated reconstructed image is stored in the reconstructed picture buffer 710. Reconstructed images stored in the reconstructed picture buffer 710 may be used as reference images for inter prediction of another image. An entropy encoder 735 may entropy-encode the quantized transformation coefficient, and the entropy-encoded coefficient may be output as a bitstream 740.

In order for the image encoder 700 according to various embodiments to be applied to the video encoding apparatus 150, stepwise operations of the image encoder 700 according to various embodiments may be performed per block.

FIG. 2 is a reference diagram for describing block-based bi-directional motion prediction and compensation processes, according to an embodiment.

Referring to FIG. 2, the video encoding apparatus 150 performs bi-directional motion prediction, in which a region most similar to a current block 201 of a current picture 200 to be encoded is searched for in a first reference picture 210 and a second reference picture 220. Here, the first reference picture 210 may be a picture before the current picture 200, and the second reference picture 220 may be a picture after the current picture 200. As a result of the bi-directional motion prediction, the video encoding apparatus 150 determines a first corresponding region 212 most similar to the current block 201 from the first reference picture 210, and a second corresponding region 222 most similar to the current block 201 from the second reference picture 220. Here, the first corresponding region 212 and the second corresponding region 222 may be reference regions of the current block 201.

Also, the video encoding apparatus 150 may determine a first motion vector MV1 based on a position difference between the first corresponding region 212 and a block 211 of the first reference picture 210 at the same position as the current block 201, and determine a second motion vector MV2 based on a position difference between the second corresponding region 222 and a block 221 of the second reference picture 220 at the same position as the current block 201.

The video encoding apparatus 150 performs block unit bi-directional motion compensation on the current block 201 by using the first motion vector MV1 and the second motion vector MV2.

For example, when a pixel value positioned at (i, j) of the first reference picture 210 is P0(i,j), a pixel value positioned at (i, j) of the second reference picture 220 is P1(i,j), MV1=(MVx1, MVy1), and MV2=(MVx2, MVy2), wherein i and j are each an integer, a block unit bi-directional motion compensation value P_BiPredBlock(i,j) of a pixel at a (i, j) position of the current block 201 may be calculated according to an equation: P_BiPredBlock(i,j)={P0(i+MVx1, j+MVy1)+P1(i+MVx2, j+MVy2)}/2. As such, the video encoding apparatus 150 may generate the motion compensation value in block units by performing motion compensation on the current block 201 in block unit by using an average value or weighted sum of pixels in the first and second corresponding regions 212 and 222 indicated by the first and second motion vectors MV1 and MV2.

FIGS. 3A through 3C are reference diagrams for describing processes of performing pixel unit motion compensation, according to embodiments.

In FIG. 3A, a first corresponding region 310 and a second corresponding region 320 respectively correspond to the first corresponding region 212 and the second corresponding region 222 of FIG. 2, and may have shifted to overlap a current block 300 by using bi-directional motion vectors MV1 and MV2.

Also, P(i,j) denotes a pixel of the current block 300 at a (i, j) position that is bi-directional predicted, P0(i,j) denotes a first reference pixel value of a first reference picture corresponding to the pixel P(i,j) of the current block 300 that is bi-directional predicted, and P1(i,j) denotes a second reference pixel value of a second reference picture corresponding to the pixel P(i,j) of the current block 300 that is bi-directional predicted, wherein i and j each denote an integer.

In other words, the first reference pixel value P0(i,j) is a pixel value of a pixel corresponding to the pixel P(i,j) of the current block 300 determined by the bi-directional motion vector MV1 indicating the first reference picture, and the second reference pixel value P1(i,j) (

) is a pixel value of a pixel corresponding to the pixel P(i,j) of the current block 300 determined by the bi-directional motion vector MV2 indicating the second reference picture.

Also,

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}$ denotes a gradient value of a first reference pixel in a horizontal direction,

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y}$ denotes a gradient value of the first reference pixel in a vertical direction,

$\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial x}$ denotes a gradient value of a second reference pixel in the horizontal direction, and

$\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial y}$ denotes a gradient value of the second reference pixel in the vertical direction.

Also, τ₀ denotes a temporal distance between a current picture to which the current block 300 belongs and the first reference picture to which the first corresponding region 310 belongs, and τ₁ denotes a temporal distance between the current picture and the second reference picture to which the second corresponding region 320 belongs. Here, a temporal distance between pictures may denote a difference of picture order count (POC) of the pictures.

When there is uniform small motion in a video sequence, a pixel in the first corresponding region 310 of the first reference picture, which is most similar to the pixel P(i,j) on which bi-directional motion compensation is performed in pixel units, is not the first reference pixel P0(i,j), but is a first displacement reference pixel PA, in which the first reference pixel P0(i,j) is moved by a certain displacement vector. As described above, since there is uniform motion in the video sequence, a pixel in the second corresponding region 320 of the second reference picture, which is most similar to the pixel P(i,j), may be a second displacement reference pixel PB, in which the second reference pixel P1(i,j) is moved by a certain displacement vector.

A displacement vector may include a displacement vector Vx in an x-axis direction and a displacement vector Vy in a y-axis direction. Accordingly, the pixel unit motion compensator 165 calculates the displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction included in the displacement vector, and perform motion compensation in pixel units by using the displacement vector.

An optical flow denotes a pattern of apparent motion on an object or surface, which is induced by relative motion between a scene and an observer (eyes or a video image obtaining apparatus like a camera). In a video sequence, an optical flow may be represented by calculating motion between frames obtained at arbitrary times t and t+Δt. A pixel value positioned at (x, y) in the frame of the time t may be I(x,y,t). In other words, I(x,y,t) may be a value changing temporally and spatially. I(x,y,t) may be differentiated according to Equation 1 with respect to the time t.

$\begin{matrix} {\frac{dI}{dt} = {{\frac{\partial I}{\partial x}\frac{dx}{dt}} + {\frac{\partial I}{\partial y}\frac{dy}{dt}} + \frac{\partial I}{\partial t}}} & \left\lbrack {{Equation}\mspace{14mu} 1} \right\rbrack \end{matrix}$

When a pixel value changes according to motion but does not change according to time with respect to small motion in a block, dl/dt is 0. Also, when motion of a pixel value according to time is uniform, dx/dt may denote the displacement vector Vx of the pixel value I(x,y,t) in the x-axis direction and dy/dt may denote the displacement vector Vy of the pixel value I(x,y,t) in the y-axis direction, and accordingly, Equation 1 may be expressed as Equation 2.

$\begin{matrix} {{\frac{\partial I}{\partial t} + {{Vx} \cdot \frac{\partial I}{\partial x}} + {{Vy} \cdot \frac{\partial I}{\partial y}}} = 0} & \left\lbrack {{Equation}\mspace{14mu} 2} \right\rbrack \end{matrix}$

Here, sizes of the displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction may have a value smaller than pixel accuracy used in bi-directional motion prediction. For example, when pixel accuracy is ¼ or 1/16 during bi-directional motion prediction, the sizes of the displacement vectors Vx and Vy may have a value smaller than ¼ or 1/16.

The pixel unit motion compensator 165 calculates the displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction according to Equation 2, and performs motion compensation in pixel units by using the displacement vectors Vx and Vy. In Equation 2, since the pixel value I(x,y,t) is a value of an original signal, high overheads may be induced during encoding when the value of the original signal is used. Accordingly, the pixel unit motion compensator 165 may calculate the displacement vectors Vx and Vy according to Equation 2 by using pixels of the first and second reference pictures, which are determined as results of performing bi-directional motion prediction in block units. In other words, the pixel unit motion compensator 165 determines the displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction, in which Δ is minimum in a window Ωij having a certain size and including neighboring pixels around the pixel P(i,j) on which bi-directional motion compensation is performed. Δ may be 0, but the displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction, which satisfy Δ=0 with respect to all pixels in the window Ωij, may not exist, and thus the displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction, in which Δ is minimum, are determined. Processes of obtaining the displacement vectors Vx and Vy will be described in detail with reference to FIG. 8.

In order to determine a prediction pixel value of a current pixel, a function P(t) with respect to t may be determined according to Equation 3. P(t)=a3*t ³ +a2*t ² +a1*t+a0

Here, a picture when t=0 is a current picture in which a current block is included. Accordingly, the prediction pixel value of the current pixel included in the current block may be defined as a value of P(t) when t is 0.

When the temporal distance between the current picture and the first reference picture (the first reference picture is temporally before the current picture) is τ₀ and the temporal distance between the current picture and the second reference picture (the second reference picture is temporally after the current picture) is τ₁, a reference pixel value in the first reference picture is equal to P(−τ₀), and a reference pixel value in the second reference picture is equal to P(τ₁). Hereinafter, for convenience of calculation, it is assumed that τ₀ and τ₁ are both equal to τ.

Coefficients of each degree of P(t) may be determined according to Equation 4. Here, P0(i,j) may denote a pixel value at a (i,j) position of the first reference picture, and P1(i,j) may denote a pixel value at a (i,j) of the second reference picture.

$\begin{matrix} {{{a\; 0} = {\frac{1}{2}\left( {{P\; 0\left( {i,j} \right)} + {P\; 1\left( {i,j} \right)} + {\frac{\tau}{2}\left( {\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial t} - \frac{{\partial P}\; 1\left( {i,j} \right)}{\partial t}} \right)}} \right)}}{{a\; 1} = {\frac{1}{4}\left( {{\frac{3}{\tau}\left( {{P\; 0\left( {i,j} \right)} - {P\; 1\left( {i,j} \right)}} \right)} - \frac{{\partial P}\; 0\left( {i,j} \right)}{\partial t} - \frac{{\partial P}\; 1\left( {i,j} \right)}{\partial t}} \right)}}\mspace{76mu}{{a\; 2} = {\frac{1}{4\tau}\left( {\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial t} - \frac{{\partial P}\; 1\left( {i,j} \right)}{\partial t}} \right)}}{{a\; 3} = {{\frac{1}{4\tau^{2}}\left( {{\frac{1}{\tau}\left( {P\; 0\left( {i,j} \right)} \right)} - {P\; 1\left( {i,j} \right)}} \right)} + \frac{{\partial P}\; 0\left( {i,j} \right)}{\partial t} + \frac{{\partial P}\; 1\left( {i,j} \right)}{\partial t}}}} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack \end{matrix}$

Accordingly, a prediction pixel value P(0) of the current pixel in the current block may be determined according to Equation 5.

$\begin{matrix} {{P(0)} = {{a\; 0} = {{a\; 0} = {\frac{1}{2}\left( {{P\; 0\left( {i,j} \right)} + {P\; 1\left( {i,j} \right)} + {\frac{\tau}{2}\left( {\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial t} - \frac{{\partial P}\; 1\left( {i,j} \right)}{\partial t}} \right)}} \right)}}}} & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack \end{matrix}$

Equation 5 may be expressed as Equation 6 considering Equation 2.

$\begin{matrix} {{P(0)} = {{a\; 0} = {\frac{1}{2}\left( {{P\; 0\left( {i,j} \right)} + {P\; 1\left( {i,j} \right)} + {\frac{\tau\;{Vx}}{2}\left( {\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial x} - \frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}} \right)} + {\frac{\tau\;{Vy}}{2}\left( {\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial y} - \frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y}} \right)}} \right)}}} & \left\lbrack {{Equation}\mspace{14mu} 6} \right\rbrack \end{matrix}$

Accordingly, the prediction pixel value of the current pixel may be determined by using the displacement vector Vx, the displacement vector Vy, gradient values of the first reference pixel in the horizontal and vertical directions, and gradient values of the second reference pixel in the horizontal and vertical directions. Here, a portion (P0(i,j)+P1(i,j))/2) not related to the displacement vectors Vx and Vy may be a motion compensation value in block units, and a portion related to the displacement vectors Vx and Vy may be a motion compensation value in pixel units. As a result, the prediction pixel value of the current pixel may be determined by adding the motion compensation value in block units and the motion compensation value in pixel units.

Hereinabove, processes of determining the prediction pixel value of the current pixel when the temporal distance between the first reference picture and the current picture and the temporal distance between the second reference picture and the current picture are both τ, and thus the same are described for convenience of description, but the temporal distance between the first reference picture and the current picture may be τ₀ and the temporal distance between the second reference picture and the current picture may be τ₁. Here, the prediction pixel value P(0) of the current pixel may be determined according to Equation 7.

$\begin{matrix} {{P(0)} = {{P\; 0\left( {i,j} \right)} + {P\; 1\left( {i,j} \right)} + {\frac{1}{2}\left( {{\tau_{0}\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial t}} - {\tau_{1}\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial t}}} \right)}}} & \left\lbrack {{Equation}\mspace{14mu} 7} \right\rbrack \end{matrix}$

Considering Equation 2, Equation 7 may be expressed as Equation 8.

$\begin{matrix} {{P(0)} = {{P\; 0\left( {i,j} \right)} + {P\; 1\left( {i,j} \right)} + {\frac{Vx}{2}\left( {{\tau_{1}\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial x}} - {\tau_{0}\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}}} \right)} + {\frac{Vy}{2}\left( {{\tau_{1}\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial y}} - {\tau_{0}\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y}}} \right)}}} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack \end{matrix}$

Hereinabove, the first reference picture is displayed temporally after the current picture and the second reference picture is displayed temporally before the current picture, but alternatively, the first and second reference pictures may both be displayed temporally before the current picture, or after the current picture.

For example, as shown in FIG. 3B, the first reference picture including the first corresponding region 310 and the second reference picture including the second corresponding region 320 may both be displayed temporally before the current picture including the current block 300.

In this case, the prediction pixel value P(0) of the current pixel may be determined according to Equation 9, in which τ₁ indicating the temporal distance between the second reference picture and the current picture in Equation 8 indicated with reference to FIG. 3A is replaced by −τ₁.

$\begin{matrix} {{P(0)} = {{P\; 0\left( {i,j} \right)} + {P\; 1\left( {i,j} \right)} + {\frac{Vx}{2}\left( {{{- \tau_{1}}\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial x}} - {\tau_{0}\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}}} \right)} + {\frac{Vy}{2}\left( {{{- \tau_{1}}\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial y}} - {\tau_{0}\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y}}} \right)}}} & \left\lbrack {{Equation}\mspace{14mu} 9} \right\rbrack \end{matrix}$

For example, as shown in FIG. 3C, the first reference picture including the first corresponding region 310 and the second reference picture including the second corresponding region 320 may both be displayed temporally after the current picture including the current block 300.

In this case, the prediction pixel value P(0) of the current pixel may be determined according to Equation 10, in which τ₀ indicating the temporal distance between the first reference picture and the current picture in Equation 8 indicated with reference to FIG. 3A is replaced by −τ₀.

$\begin{matrix} {{P(0)} = {{P\; 0\left( {i,j} \right)} + {P\; 1\left( {i,j} \right)} + {\frac{Vx}{2}\left( {{\tau_{1}\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial x}} + {\tau_{0}\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}}} \right)} + {\frac{Vy}{2}\left( {{\tau_{1}\frac{{\partial P}\; 1\left( {i,j} \right)}{\partial y}} + {\tau_{0}\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y}}} \right)}}} & \left\lbrack {{Equation}\mspace{14mu} 10} \right\rbrack \end{matrix}$

However, when the first and second reference pictures are both displayed temporally before the current picture or after the current picture as shown in FIGS. 3B and 3C, motion compensation in pixel units may be performed when the first reference picture and the second reference picture are not the same reference picture. Also, in this case, motion compensation in pixel units may be performed only when the bi-directional motion vectors MV1 and MV2 both have a non-zero component. Also, in this case, the motion compensation in pixel units may be performed only when a ratio of the motion vectors MV1 and MV2 is the same as a ratio of the temporal distance between the first reference picture and the current picture and the temporal distance between the second reference picture and the current picture. For example, the motion compensation in pixel units may be performed when a ratio of an x component of the motion vector MV1 and an x component of the motion vector MV2 is the same as a ratio of a y component of the motion vector MV1 and a y component of the motion vector MV2, and is the same as a ratio of the temporal distance τ₀ between the first reference picture and the current picture and the temporal distance τ₁ between the second reference picture and the current picture.

FIG. 4 is a reference diagram for describing processes of calculating gradient values in horizontal and vertical directions, according to an embodiment.

Referring to FIG. 4, a gradient value

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}$ of a first reference pixel P0(i,j) 410 of a first reference picture in a horizontal direction and a gradient value

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y}$ of the first reference pixel P0(i,j) 410 in a vertical direction may be calculated by obtaining a variation of a pixel value at a neighboring fractional pixel position adjacent to the first reference pixel P0(i,j) 410 in the horizontal direction and a variation of a pixel value at a neighboring fractional pixel position adjacent to the first reference pixel P0(i,j) 410 in the vertical direction. In other words, according to Equation 11, the gradient value

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}$ in the horizontal direction may be calculated by calculating a variation of pixel values of a fractional pixel P0(i−h,j) 460 and a fractional pixel P0(i+h,j) 470 away from P0(i,j) by h in the horizontal direction, wherein h is a fraction smaller than 1, and the gradient value

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y}$ in the vertical direction may be calculated by calculating a variation of pixel values of a fractional pixel P0(i,j−h) 480 and a fractional pixel P0(i,j+h) 490 away from P0(i,j) by h in the vertical direction.

$\begin{matrix} {{\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x} = \frac{{P\; 0\left( {{i + h},j} \right)} - {P\; 0\left( {{i - h},j} \right)}}{2h}}{\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial y} = \frac{{P\; 0\left( {i,{j + h}} \right)} - {P\; 0\left( {i,{j - h}} \right)}}{2h}}} & \left\lbrack {{Equation}\mspace{14mu} 11} \right\rbrack \end{matrix}$

Pixel values of the fractional pixels P0(i−h,j) 460, P0(i+h,j) 470, P0(i,j−h) 480, and P0(i,j+h) 490 may be calculated by using general interpolation. Also, gradient values of a second reference pixel of a second reference picture in horizontal and vertical directions may also be calculated similarly to Equation 11.

According to an embodiment, instead of calculating a gradient value by calculating a variation of pixel values at fractional pixel positions as in Equation 11, a gradient value in a reference pixel may be calculated by using a certain filter. A filter coefficient of the certain filter may be determined based on a coefficient of an interpolation filter used to obtain a pixel value at a fractional pixel position considering linearity of a filter.

FIG. 5 is a reference diagram for describing processes of calculating gradient values in horizontal and vertical directions, according to another embodiment.

According to another embodiment, a gradient value may be determined by applying a certain filter to pixels of a reference picture. Referring to FIG. 5, the video decoding apparatus 100 may calculate a gradient value of a reference pixel P0 500 in a horizontal direction by applying a certain filter to M_(Max) left pixels 520 and |M_(Min)| right pixels 510 based on the reference pixel P0 500 of which a current horizontal gradient value is to be obtained. A filter coefficient used here may be determined according to a value α indicating an interpolation position (fractional pel position) between M_(Max) and M_(Min) integer pixels used to determine a window size, as shown in FIGS. 7A through 7D. For example, referring to FIG. 7A, when M_(Min) and M_(Max) for determining a window size are respectively −2 and 3, and are away from the reference pixel P0 500 by ¼, i.e., α=¼, coefficient filters {4, −17. −36. 60, −15, 4} in a second row of FIG. 7A are applied to neighboring pixels P⁻², P⁻¹, P₀, P₁, P₂, and P₃. In this case, a gradient value

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}$ of the reference pixel P0 500 in the horizontal direction may be calculated via a weighted sum using a filter coefficient and a neighboring pixel, such as an equation;

$\frac{{\partial P}\; 0\left( {i,j} \right)}{\partial x}$ 4*P⁻²−17*P⁻¹+−36*P₀+60*P₁−15*P₂+4*P₃+32>>6. Similarly, a gradient value in a vertical direction may also be calculated by applying the filter coefficients shown in FIGS. 7A through 7E to neighboring pixels according to an interpolation position, and M_(Min) and M_(Max) for determining a window size.

FIGS. 6A and 6B are diagrams for describing processes of determining gradient values in horizontal and vertical directions by using 1D filters, according to embodiments.

Referring to FIG. 6A, filtering may be performed by using a plurality of 1D filters with respect to an integer pixel so as to determine a gradient value of a reference pixel in a horizontal direction in a reference picture. Motion compensation in pixel units is additional motion compensation performed after motion compensation in block units. Accordingly, a reference position of reference blocks of a current block indicated by a motion vector during motion compensation in block units may be a fractional pixel position, and motion compensation in pixel units may be performed with respect to reference pixels in a reference block at a fractional pixel position. Accordingly, filtering may be performed considering that a gradient value of a pixel at a fractional pixel position is determined.

Referring to FIG. 6A, first, the video decoding apparatus 100 may perform filtering on pixels positioned in a horizontal or vertical direction from a neighboring integer pixel of a reference pixel in a reference picture, by using a first 1D filter. Similarly, the video decoding apparatus 100 may perform filtering on adjacent integer pixels in a row or column different from the reference pixel, by using the first 1D filter. The video decoding apparatus 100 may generate a gradient value of the reference pixel in the horizontal direction by performing filtering on values generated via the filtering, by using a second 1D filter.

For example, when a position of a reference pixel is a position of a fractional pixel at (x+α, y+β), wherein x and y are each an integer and α and β are each a fraction, filtering may be performed according to Equation 12 by using a 1D vertical interpolation filter with respect to integer pixels (x,y), (x−1,y), (x+1, y), through (x+M_(Min),y) and (x+M_(Max),y) in a horizontal direction, wherein M_(Min) and M_(Mmax) are each an integer.

$\begin{matrix} {{{{Temp}\left\lbrack {i,{j + \beta}} \right\rbrack} = \left( {{\sum\limits_{j^{\prime} = {j + M_{\min}}}^{j^{\prime} = {j + M_{\max}}}{{{fracFilter}_{\beta}\left\lbrack j^{\prime} \right\rbrack}{I\left\lbrack {i,j^{\prime}} \right\rbrack}}} + {offset}_{1}} \right)}\operatorname{>>}{shift}_{1}} & \left\lbrack {{Equation}\mspace{14mu} 12} \right\rbrack \end{matrix}$

Here, fracFilter_(β) may denote an interpolation filter for determining a pixel value at a fractional pixel position β in a vertical direction, and fracFilter_(β)[j′] may denote a coefficient of an interpolation filter applied to a pixel at a (i,j′) position. I[i,j′] may denote a pixel value at the (i,j′) position.

In other words, the first 1D filter may be an interpolation filter for determining a fractional pixel value in a vertical direction. offset₁ may denote an offset for preventing a round-off error, and shift₁ may denote a de-scaling bit number. Temp[i,j+β] may denote pixel value at a fractional pixel position (i,j+β). Temp[i′,j+β] may also be determined according to Equation 12 by replacing i by i′, wherein i′ is an integer from i+M_(min) to, i+M_(max) excluding i.

Then, the video decoding apparatus 100 may perform filtering on a pixel value at a fractional pixel position (i,j+β) and a pixel value at a fractional pixel position (i′,j+β) by using a second 1D filter.

$\begin{matrix} {{{\frac{\partial I}{\partial x}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack} = \left( {{\sum\limits_{i^{\prime} = {i + M_{\min}}}^{i^{\prime} = {i + M_{\max}}}{{{gradFilter}_{\alpha}\left\lbrack i^{\prime} \right\rbrack}{I\left\lbrack {i^{\prime},{j + \beta}} \right\rbrack}}} + {offset}_{2}} \right)}\operatorname{>>}{shift}_{2}} & \left\lbrack {{Equation}\mspace{14mu} 13} \right\rbrack \end{matrix}$

Here, gradFilter_(α) may be a gradient filter for determining a gradient value at a fractional pixel position α in a horizontal direction. gradFilter_(α)[i′] may denote a coefficient of an interpolation filter applied to a pixel at a (i′,j+β) position. In other words, the second 1D filter may be a gradient filter for determining a gradient value in a horizontal direction. offset₂ may denote an offset for preventing a round-off error, and shift₂ may denote a de-scaling bit number.

In other words, according to Equation 13, the video decoding apparatus 100 may determine a gradient value

$\frac{\partial I}{\partial x}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack$ in a horizontal direction at (i+α,j+β) by performing filtering on a pixel value (Temp[i,j+β]) at a pixel position (i, j+β) and a pixel value (Temp[i′,j+β]) positioned in a vertical direction from the pixel position (i, j+β), by using the gradient filter gradFilter_(α).

Hereinabove, a gradient value in a horizontal direction is determined by first applying an interpolation filter and then applying a gradient filter, but alternatively, the gradient value in the horizontal direction may be determined by first applying the gradient filter and then applying the interpolation filter. Hereinafter, an embodiment of determining a gradient value in a horizontal direction by applying a gradient filter and then an interpolation filter will be described.

For example, when a position of a reference pixel is a position of a fractional pixel at (x+α, y+β), wherein x and y are each an integer and α and β are each a fraction, filtering may be performed according to Equation 14 by using the first 1D filter, with respect to integer pixels (x,y), (x−1,y), (x+1, y), through (x+M_(Min),y) and (x+M_(Max),y) in a horizontal direction, wherein M_(Min) and M_(Mmax) are each an integer.

$\begin{matrix} {{{{Temp}\left\lbrack {{i + \alpha},j} \right\rbrack} = \left( {{\sum\limits_{i^{\prime} = {i + M_{\min}}}^{i^{\prime} = {i + M_{\max}}}{{{gradFilter}_{\alpha}\left\lbrack i^{\prime} \right\rbrack}{I\left\lbrack {i^{\prime},{j + \beta}} \right\rbrack}}} + {offset}_{3}} \right)}\operatorname{>>}{shift}_{3}} & \left\lbrack {{Equation}\mspace{14mu} 14} \right\rbrack \end{matrix}$

Here, gradFilter_(α) may denote a gradient filter for determining a gradient value at a fractional pixel position α in a horizontal direction, and gradFilter_(α)[i′] may denote a coefficient of a gradient filter applied to a pixel at a (i′,j) position. I[i′,j] may denote a pixel value at the (i′,j) position.

In other words, the first 1D filter may be an interpolation filter for determining a gradient value of a pixel in a horizontal direction, wherein a horizontal component of a pixel position is a fractional position. offset₃ may denote an offset for preventing a round-off error, and shift₃ may denote a de-scaling bit number. Temp[i+α,j] may denote a gradient value at a pixel position (i+α,j) in the horizontal direction. Temp[i+α,j′] may also be determined according to Equation 14 by replacing j by j′, wherein j′ is an integer from j+M_(min) to, j+M_(max) excluding j.

Then, the video decoding apparatus 100 may perform filtering on a gradient value at a pixel position (i+α,j) in the horizontal direction and a gradient value at a pixel position (i+α,j′) in the horizontal direction by using the second 1D filter, according to Equation 15.

$\begin{matrix} {{{\frac{\partial I}{\partial x}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack} = \left( {{\sum\limits_{j^{\prime} = {j + M_{\min}}}^{j^{\prime} = {j + M_{\max}}}{{{fracFilter}_{\beta}\left\lbrack j^{\prime} \right\rbrack}{{Temp}\left\lbrack {{i + \alpha},j^{\prime}} \right\rbrack}}} + {offset}_{4}} \right)}\operatorname{>>}{shift}_{4}} & \left\lbrack {{Equation}\mspace{14mu} 15} \right\rbrack \end{matrix}$

Here, fracFilter_(β) may be an interpolation filter for determining a pixel value at a fractional pixel position β in a vertical direction. fracFilter_(β)[j′] may denote a coefficient of an interpolation filter applied to a pixel at a (i+β, j′) position. In other words, the second 1D filter may be an interpolation filter for determining a pixel value at a fractional pixel position β in a vertical direction. offset₄ may denote an offset for preventing a round-off error, and shift₄ may denote a de-scaling bit number.

In other words, according to Equation 15, the video decoding apparatus 100 may determine a gradient value

$\frac{\partial I}{\partial x}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack$ in a horizontal direction at (i+α,j+β) by performing filtering on a gradient value (Temp[i+α,j]) at a pixel position (i+α, j) in a horizontal direction and a gradient value (Temp[i+α,j′]) of pixels in a horizontal direction positioned in a vertical direction from the pixel position (i+α, j), by using the gradient filter fracFilter_(β).

Referring to FIG. 6B, filtering may be performed by using a plurality of 1D filters with respect to an integer pixel so as to determine a gradient value of a reference pixel in a vertical direction in a reference picture. Motion compensation in pixel units is additional motion compensation performed after motion compensation in block units. Accordingly, a reference position of reference blocks of a current block indicated by a motion vector during motion compensation in block units may be a fractional pixel position, and motion compensation in pixel units may be performed with respect to reference pixels in a reference block at a fractional pixel position. Accordingly, filtering may be performed considering that a gradient value of a pixel at a fractional pixel position is determined.

Referring to FIG. 6B, first, the video decoding apparatus 100 may perform filtering on pixels positioned in a horizontal or vertical direction from a neighboring integer pixel of a reference pixel in a reference picture, by using a first 1D filter. Similarly, the video decoding apparatus 100 may perform filtering on adjacent integer pixels in a row or column different from the reference pixel, by using the first 1D filter. The video decoding apparatus 100 may generate a gradient value of the reference pixel in the vertical direction by performing filtering on values generated via the filtering, by using a second 1D filter.

For example, when a position of a reference pixel is a position of a fractional pixel at (x+α, y+β), wherein x and y are each an integer and α and β are each a fraction, filtering may be performed according to Equation 16 by using the first 1D filter with respect to integer pixels (x,y), (x−1,y−1), (x+1, y+1) through (x+M_(Min),y+M_(Min)) and (x+M_(Max),Y+M_(max)) in a horizontal direction, wherein M_(Min) and M_(Mmax) are each an integer.

$\begin{matrix} {{{{Temp}\left\lbrack {{i + \alpha},j} \right\rbrack} = \left( {{\sum\limits_{i^{\prime} = {i + M_{\min}}}^{i^{\prime} = {i + M_{\max}}}{{{fracFilter}_{\alpha}\left\lbrack i^{\prime} \right\rbrack}{I\left\lbrack {i^{\prime},j} \right\rbrack}}} + {offset}_{5}} \right)}\operatorname{>>}{shift}_{5}} & \left\lbrack {{Equation}\mspace{14mu} 16} \right\rbrack \end{matrix}$

Here, fracFilter_(α) may denote an interpolation filter for determining a pixel value at a fractional pixel position α in a horizontal direction, and fracFilter_(α)[i′] may denote a coefficient of an interpolation filter applied to a pixel at a (i′,j) position. I[i′,j] may denote a pixel value at the (i′,j) position.

In other words, the first 1D filter may be an interpolation filter for determining a pixel value at a fractional pixel position α in a horizontal direction. offset₅ may denote an offset for preventing a round-off error, and shift₅ may denote a de-scaling bit number.

Temp[i+α,j] may denote pixel value at a fractional pixel position (i+α,j). Temp[i+α,j′] may also be determined according to Equation 16 by replacing j by j′, wherein j′ is an integer from j+M_(min) to, j+M_(max) excluding j.

Then, the video decoding apparatus 100 may perform filtering on a pixel value at a pixel position (i+α,j) and a pixel value at a pixel position (i+α,j′) according to Equation 17, by using a second 1D filter.

$\begin{matrix} {{{\frac{\partial I}{\partial y}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack} = \left( {{\sum\limits_{j^{\prime} = {j + M_{\min}}}^{j^{\prime} = {j + M_{\max}}}{{{gradFilter}_{\beta}\left\lbrack j^{\prime} \right\rbrack}{{Temp}\left\lbrack {{i + \alpha},j^{\prime}} \right\rbrack}}} + {offset}_{6}} \right)}\operatorname{>>}{shift}_{6}} & \left\lbrack {{Equation}\mspace{14mu} 17} \right\rbrack \end{matrix}$

Here, gradFilter_(β) may be a gradient filter for determining a gradient value at a fractional pixel position β in a vertical direction. gradFilter_(β)[j′] may denote a coefficient of an interpolation filter applied to a pixel at a (i+α,j′) position. In other words, the second 1D filter may be a gradient filter for determining a gradient value in a vertical direction at a fractional pixel position β. offset₆ may denote an offset for preventing a round-off error, and shift₆ may denote a de-scaling bit number.

In other words, according to Equation 17, the video decoding apparatus 100 may determine a gradient value

$\frac{\partial I}{\partial x}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack$ in a vertical direction at (i+α,j+β) by performing filtering on a pixel value (Temp[i+α,j]) at a pixel position (i+α,j) and a pixel value (Temp[i+α,j′]) positioned in a vertical direction from the pixel position (i+α,j), by using the gradient filter gradFilter_(β).

Hereinabove, a gradient value in a vertical direction is determined by first applying an interpolation filter and then applying a gradient filter, but alternatively, the gradient value in the vertical direction may be determined by first applying the gradient filter and then applying the interpolation filter. Hereinafter, an embodiment of determining a gradient value in a vertical direction by applying a gradient filter and then an interpolation filter will be described.

For example, when a position of a reference pixel is a position of a fractional pixel at (x+α, y+β), wherein x and y are each an integer and α and β are each a fraction, filtering may be performed according to Equation 18 by using the first 1D filter, with respect to integer pixels (x,y), (x,y−1), (x, y+1) through (x,y+M_(Min)) and (x,y+M_(max)) in a vertical direction, wherein M_(Min) and M_(Mmax) are each an integer.

$\begin{matrix} {{{{Temp}\left\lbrack {i,{j + \beta}} \right\rbrack} = \left( {{\sum\limits_{j^{\prime} = {j + M_{\min}}}^{j^{\prime} = {j + M_{\max}}}{{{gradFilter}_{\beta}\left\lbrack j^{\prime} \right\rbrack}{I\left\lbrack {i,j^{\prime}} \right\rbrack}}} + {offset}_{7}} \right)}\operatorname{>>}{shift}_{7}} & \left\lbrack {{Equation}\mspace{14mu} 18} \right\rbrack \end{matrix}$

Here, gradFilter_(β) may denote a gradient filter for determining a gradient value at a fractional pixel position β in a vertical direction, and gradFilter_(β)[j′] may denote a coefficient of a gradient filter applied to a pixel at a (i,j′) position. I[i,j′] may denote a pixel value at the (i,j′) position.

In other words, the first 1D filter may be an interpolation filter for determining a gradient value of a pixel in a vertical direction, wherein a vertical component of a pixel position is a fractional position. offset₇ may denote an offset for preventing a round-off error, and shift₇ may denote a de-scaling bit number.

Temp[i,j+β] may denote a gradient value at a pixel position (i,j+β) in the vertical direction. Temp[i′,j+β] may also be determined according to Equation 18 by replacing i by i′, wherein i′ is an integer from i+M_(min) to, i+M_(max) excluding i.

Then, the video decoding apparatus 100 may perform filtering on a gradient value at a pixel position (i, j+β) in the vertical direction and a gradient value at a pixel position (i′,j+β) in the vertical direction by using the second 1D filter, according to Equation 19.

$\begin{matrix} {{{\frac{\partial I}{\partial y}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack} = \left( {{\sum\limits_{i^{\prime} = {i + M_{\min}}}^{i^{\prime} = {i + M_{\max}}}{{{fracFilter}_{\alpha}\left\lbrack i^{\prime} \right\rbrack}{{Temp}\left\lbrack {i^{\prime},{j + \beta}} \right\rbrack}}} + {offset}_{5}} \right)}\operatorname{>>}{shift}_{8}} & \left\lbrack {{Equation}\mspace{14mu} 19} \right\rbrack \end{matrix}$

Here, fracFilter_(α) may be an interpolation filter for determining a pixel value at a fractional pixel position α in a horizontal direction. fracFilter_(α)[i′] may denote a coefficient of an interpolation filter applied to a pixel at a (i′,j+β) position. In other words, the second 1D filter may be an interpolation filter for determining a pixel value at a fractional pixel position α in a horizontal direction. offset₈ may denote an offset for preventing a round-off error, and shift₈ may denote a de-scaling bit number.

In other words, according to Equation 19, the video decoding apparatus 100 may determine a gradient value

$\frac{\partial I}{\partial x}\left\lbrack {{i + \alpha},{j + \beta}} \right\rbrack$ in a vertical direction at (i+α,j+β) by performing filtering on a gradient value (Temp[i,j+β]) at a pixel position (i, j+β) in a vertical direction and a gradient value (Temp[i′, j+β)]) of pixels in a vertical direction positioned in a horizontal direction from the pixel position (i, j+β), by using the gradient filter fracFilter_(α).

According to an embodiment, in the video decoding apparatus 100, gradient values in horizontal and vertical directions at (i+α, j+β) may be determined according to combinations of various filters described above. For example, in order to determine a gradient value in a horizontal direction, an interpolation filter for determining a pixel value in a vertical direction may be used as a first 1D filter and a gradient filter for determining a gradient value in a horizontal direction may be used as a second 1D filter. Alternatively, a gradient filter for determining a gradient value in a vertical direction may be used as a first 1D filter, and an interpolation filter for determining a pixel value in a horizontal direction may be used as a second 1D filter.

FIGS. 7A through 7E are tables showing filter coefficients of filters used to determine a pixel value at a fractional pixel position of a fractional pixel unit, and gradient values in horizontal and vertical directions, according to embodiments.

FIGS. 7A and 7B are tables showing filter coefficients of filters for determining a gradient value at a fractional pixel position of ¼ pel units, in a horizontal or vertical direction.

As described above, a 1D gradient filter and a 1D interpolation filter may be used to determine a gradient value in a horizontal or vertical direction. Referring to FIG. 7A, filter coefficients of a 1D gradient filter are illustrated. Here, a 6-tap filter may be used as the 1D gradient filter. The filter coefficients of the 1D gradient filter may be coefficients scaled by 2{circumflex over ( )}4. Mmin denotes a difference between a position of a center integer pixel and a position of a farthest pixel from among integer pixels in a negative direction applied to a filter based on the center integer pixel, and Mmax denotes a difference between the position of the center integer pixel and a position of a farthest pixel from among integer pixels in a positive direction applied to the filter based on the center integer pixel. For example, gradient filter coefficients for obtaining a gradient value of a pixel in a horizontal direction, in which a fractional pixel position α is ¼ in the horizontal direction, may be {4, −17, −36, 60, −15, −4}. Gradient filter coefficients for obtaining a gradient value of a pixel in the horizontal direction, in which a fractional pixel position α is 0, ½, or ¾ in the horizontal direction, may also be determined by referring to FIG. 7A.

Referring to FIG. 7B, filter coefficients of a 1D interpolation filter are illustrated. Here, a 6-tap filter may be used as the 1D interpolation filter. The filter coefficients of the 1D interpolation filter may be coefficients scaled by 2{circumflex over ( )}6. Mmin denotes a difference between a position of a center integer pixel and a position of a farthest pixel from among integer pixels in a negative direction applied to a filter based on the center integer pixel, and Mmax denotes a difference between the position of the center integer pixel and a position of a farthest pixel from among integer pixels in a positive direction applied to the filter based on the center integer pixel.

FIG. 7C is a table showing filter coefficients of a 1D interpolation filter used to determine a pixel value at a fractional pixel position of ¼ pel units.

As described above, two same 1D interpolation filters may be used in horizontal and vertical directions to determine a pixel value at a fractional pixel position.

Referring to FIG. 7C, filter coefficients of a 1D interpolation filter are illustrated. Here, a 6-tap filter may be used as the 1D interpolation filter. The filter coefficients of the 1D interpolation filter may be coefficients scaled by 2{circumflex over ( )}6. Mmin denotes a difference between a position of a center integer pixel and a position of a farthest pixel from among integer pixels in a negative direction applied to a filter based on the center integer pixel, and Mmax denotes a difference between the position of the center integer pixel and a position of a farthest pixel from among integer pixels in a positive direction applied to the filter based on the center integer pixel.

FIG. 7D is a table showing filter coefficients of filters used to determine a gradient value in a horizontal or vertical direction at a fractional pixel position of 1/16 pel units.

As described above, 1D gradient filter and 1D interpolation filter may be used to determine a gradient value in a horizontal or vertical direction. Referring to FIG. 7D, filter coefficients of a 1D gradient filter are illustrated. Here, a 6-tap filter may be used as the 1D gradient filter. The filter coefficients of the 1D gradient filter (may be coefficients scaled by 2{circumflex over ( )}4. For example, gradient filter coefficients for obtaining a gradient value of a pixel in a horizontal direction, in which a fractional pixel position α is 1/16 in the horizontal direction, may be {8, −32, −13, 50, −18, 5}. Gradient filter coefficients for obtaining a gradient value of a pixel in the horizontal direction, in which a fractional pixel position α is 0, ⅛, 3/16, ¼, 5/16, ⅜, 7/16, or ½ in the horizontal direction, may also be determined by referring to FIG. 7D. Meanwhile, gradient filter coefficients for obtaining a gradient value of a pixel in the horizontal direction, in which a fractional pixel position α is 9/16, ⅝, 11/16, ¾, 13/16, ⅞, or 15/16 in the horizontal direction, may be determined by using symmetry of filter coefficients based on α=½. In other words, filter coefficients at right fractional pixel positions based on α=½ may be determined by using filter coefficients at left fractional pixel positions based on α=½ shown in FIG. 7D. For example, filter coefficients at α= 15/16 may be determined by using filter coefficients {8, −32, −13, 50, −18, 5} at α= 1/16, which is a symmetric position based on α=½. In other words, filter coefficients at α= 15/16 may be determined to be {5, −18, 50, −13, −32, 8} by arranging {8, −32, −13, 50, −18, 5} in an inverse order.

Referring to FIG. 7E, filter coefficients of a 1D interpolation filter are illustrated. Here, a 6-tap filter may be used as the 1D interpolation filter. The filter coefficients of the 1D interpolation filter may be coefficients scaled by 2{circumflex over ( )}6. For example, 1D interpolation filter coefficients for obtaining a pixel value of a pixel in a horizontal direction, in which a fractional pixel position α is 1/16 in the horizontal direction, may be {1, −3, 64, 4, −2, 0}. Interpolation filter coefficients for obtaining a pixel value of a pixel in the horizontal direction, in which a fractional pixel position α is 0, ⅛, 3/16, ¼, 5/16, ⅜, 7/16, or ½ in the horizontal direction, may also be determined by referring to FIG. 7E. Meanwhile, interpolation filter coefficients for obtaining a pixel value of a pixel in the horizontal direction, in which a fractional pixel position α is 9/16, ⅝, 11/16, ¾, 13/16, ⅞, or 15/16 in the horizontal direction, may be determined by using symmetry of filter coefficients based on α=½. In other words, filter coefficients at right fractional pixel positions based on α=½ may be determined by using filter coefficients at left fractional pixel positions based on α=½ shown in FIG. 7E. For example, filter coefficients at α= 15/16 may be determined by using filter coefficients {1, −3, 64, 4, −2, 0} at α= 1/16, which is a symmetric position based on α=½. In other words, filter coefficients at α= 15/16 may be determined to be {0, −2, 4, 64, −3, 1} by arranging {1, −3, 64, 4, −2, 0} in an inverse order.

FIG. 8 is a reference diagram for describing processes of determining a horizontal direction displacement vector and a vertical direction displacement vector, according to an embodiment.

Referring to FIG. 8, a window Ωij 800 having a certain size has a size of (2M+1)*(2N+1) based on a pixel P(i,j) that is bi-directionally predicted from a current block, wherein M and N are each an integer.

When P(i′,j′) denotes a pixel of a current block bi-directionally predicted in the window Ωij 800, wherein, when i−M≤i′≤i+M and j−N≤j′≤j+N, (i′,j′)∈Ωij, P0(i′,j′) denotes a pixel value of a first reference pixel of a first reference picture 810 corresponding to the pixel P(i′,j′) of the current block bi-directionally predicted, P1(i′,j′) denotes a pixel value of a second reference pixel of a second reference picture 820 corresponding to the pixel P(i′,j′) of the current block bi-directionally predicted,

$\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}$ denotes a gradient value of the first reference pixel in a horizontal direction,

$\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}$ denotes a gradient value of the first reference pixel in a vertical direction,

$\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}$ denotes a gradient value of the second reference pixel in the horizontal direction,

$\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}$ and denotes a gradient value of the second reference pixel in the vertical direction, a first displacement corresponding pixel PA′ and a second displacement corresponding pixel PB′ may be determined according to Equation 20. Here, PA′ and PB′ may be determined by using a first linear term of local Taylor expansion.

$\begin{matrix} {{{PA}^{\prime} = {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {{\tau 0}*{Vx}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} - {{\tau 0}*{Vy}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}}}{{PB}^{\prime} = {{P\; 1\left( {i^{\prime},j^{\prime}} \right)} + {{\tau 1}*{Vx}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 1}*{Vy}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}}}} & \left\lbrack {{Equation}\mspace{14mu} 20} \right\rbrack \end{matrix}$

In Equation 20, a displacement vector Vx in an x-axis direction and a displacement vector Vy in a y-axis direction may be changed according to a position of the pixel P(i,j), i.e., are dependent on (i,j), the displacement vectors Vx and Vy may be expressed as Vx(i,j) and Vy(i,j).

A difference value Δi′j′ between the first displacement corresponding pixel PA′ and the second displacement corresponding pixel PB′ may be determined according to Equation 21.

$\begin{matrix} \begin{matrix} {{\Delta\; i^{\prime}},{j^{\prime} =}} & {\left( {{P\; 0\left( {u^{\prime},j^{\prime}} \right)} - {{\tau 0}*{Vx}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} -} \right.} \\  & {{{\tau 0}*{Vy}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} - \left( {{P\; 1\left( {i^{\prime},j^{\prime}} \right)} -} \right.} \\  & {{{\tau 1}*{Vx}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 1}*{Vy}\frac{{\partial 1}\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}} \\ {=} & {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)} - {{Vx}\left( {{{\tau 0}*\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} +} \right.}} \\  & {\left. {{\tau 1}*\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} \right){- {Vy}}\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} +} \right.} \\  & \left. {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} \right) \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 21} \right\rbrack \end{matrix}$

The displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction, which minimize the difference value Δi′j′ between the first displacement corresponding pixel PA′ and the second displacement corresponding pixel PB′, may be determined by using the sum of squares ϕ(Vx,Vy) of the difference value Δi′j′ as in Equation 22.

$\begin{matrix} \begin{matrix} {{\Phi\left( {{Vx},{Vy}} \right)} =} & {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}\Delta_{i^{\prime}j^{\prime}}^{2}} \\ {=} & {\sum\limits_{{i^{\prime}j^{\prime}} \in {\Omega\;{ij}}}\left( {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)} - {{{Vx}\left( {i,j} \right)}\left( {{\tau 0}*} \right.}} \right.} \\  & {\left. {\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x} + {{\tau 1}*\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}}} \right) -} \\  & \left. {{{Vy}\left( {i,j} \right)}\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}} \right)} \right)^{2} \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 22} \right\rbrack \end{matrix}$

In other words, the displacement vectors Vx and Vy may be determined by using a local maximum value or a local minimum value of ϕ(Vx,Vy). ϕ(Vx,Vy) denotes a function using the displacement vectors Vx and Vy as parameters, and the local maximum or local minimum value may be determined by calculating a value that becomes 0 by partially differentiating ϕ(Vx,Vy) arranged for τVx and τVy, with respect to τVx and τVy according to Equation 23. Hereinafter, for convenience of calculation, τ0 and τ1 are both the same, i.e., both T.

$\begin{matrix} {{\Phi\left( {{Vx},{Vy}} \right)} = {{\left( {\tau\;{Vx}} \right)^{2}s\; 1} + {2\left( {\tau\;{Vx}} \right)\left( {\tau\;{Vy}} \right)s\; 2} + {\left( {\tau\;{Vy}} \right)^{2}s\; 5} - {2\left( {\tau\;{Vx}} \right)s\; 3} - {2\left( {\tau\;{Vy}} \right)s\; 6} + {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}\left( {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)}} \right)^{2}}}} & \left\lbrack {{Equation}\mspace{14mu} 23} \right\rbrack \end{matrix}$

Two linear equations using Vx(i,j) and Vy(i,j) as variables as Equation 24 may be obtained by using an equation:

$\frac{\partial{\Phi\left( {{Vx},{Vy}} \right)}}{{\partial\tau}\;{Vx}} = 0$ and an equation:

$\frac{\partial{\Phi\left( {{Vx},{Vy}} \right)}}{{\partial\tau}\;{Vy}} = 0.$ τVx*s1+τVy(i,j)*s2=s3 τVx*s4+τVy(i,j)*s5=s6  [Equation 24]

In Equation 24, s1 through s6 may be calculated according to Equation 25.

$\begin{matrix} {\mspace{76mu}{{{s\; 1} = {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}\left( {\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x} + \frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} \right)^{2}}}{{s\; 2} = {{s\; 4} = {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}{\left( {\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x} + \frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} \right)\left( {\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y} + \frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} \right)}}}}{{s\; 3} = {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}{\left( {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)}} \right)\left( {\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x} + \frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} \right)}}}\mspace{76mu}{{s\; 5} = {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}\left( {\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y} + \frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} \right)^{2}}}{{s\; 6} = {- {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}{\left( {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)}} \right)\left( {\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y} + \frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} \right)}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 25} \right\rbrack \end{matrix}$

By solving a simultaneous equation of Equation 24, values of Vx(i,j) and Vy(i,j) may be obtained according to τ*Vx(i,j)=−det1/det and τ*Vy(i,j)=−det2/det based on Kramer's formulas. Here, det1=s3*s5−s2*s6, det2=s1*s6−s3*s4, and det=s1*s5−s2*s2.

By performing minimization first in a horizontal direction and then in a vertical direction, simplified solutions of the above equations may be determined. In other words, when only a displacement vector in a horizontal direction is changed, Vy=0 in the first equation of Equation 24, and thus an equation: τVx=s3/s1 may be determined.

Then, an equation: τVy=(s6−τVx*S2)/s5 may be determined when the second equation of Equation 24 is arranged by using an equation: τVx=s3/s1.

Here, gradient values

$\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x},\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y},\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x},{{and}\mspace{14mu}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}$ may be scaled without changing result values Vx(i,j) and Vy(i,j). However, it is premised that an overflow does not occur and a round-off error is not generated.

Normalization parameters r and m may be introduced so as to prevent division from being performed by 0 or a very small value while calculating Vx(i,j) and Vy(i,j).

For convenience, it is considered that Vx(i,j) and Vy(i,j) are opposite to directions shown in FIG. 3A. For example, Vx(i,j) and Vy(i,j) derived by Equation 24 based on directions of Vx(i,j) and Vy(i,j) of FIG. 3A may have the same size as Vx(i,j) and Vy(i,j) determined to be opposite to the directions of FIG. 3A, except for a sign.

The first displacement corresponding pixel PA′ and the second displacement corresponding pixel PB′ may be determined according to Equation 26. Here, the first displacement corresponding pixel PA′ and the second displacement corresponding pixel PB′ may be determined by using a first linear term of local Taylor expansion.

$\begin{matrix} {{{PA}^{\prime} = {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} + {{\tau 0}*{Vx}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 0}*{Vy}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}}}{{PB}^{\prime} = {{P\; 1\left( {i^{\prime},j^{\prime}} \right)} - {{\tau 1}*{Vx}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} - {{\tau 1}*{Vy}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}}}} & \left\lbrack {{Equation}\mspace{14mu} 26} \right\rbrack \end{matrix}$

A difference value Δi′j′ between the first displacement corresponding pixel PA′ and the second displacement corresponding pixel PB′ may be determined according to Equation 27.

$\begin{matrix} {{\Delta\; i^{\prime}j^{\prime}} = \left( {{{P\; 0\left( {i^{\prime},j^{\prime}} \right)} + {{\tau 0}*{Vx}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 0}*{Vy}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)} - {{\tau 1}*{Vx}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} - {{\tau 1}*{Vy}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}\Delta\; i^{\prime}j^{\prime}}} = \left( {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)} + {{Vx}\left( {{{\tau 0}*\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 1}*\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}}} \right)} + {{Vy}\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} + {{\tau 0}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}} \right)}} \right.} \right.} & \left\lbrack {{Equation}\mspace{14mu} 27} \right\rbrack \end{matrix}$

The displacement vector Vx in the x-axis direction and the displacement vector Vy in the y-axis direction, which minimize the difference value Δi′j′ between the first displacement corresponding pixel PA′ and the second displacement corresponding pixel PB′, may be determined by using a sum of squares ϕ(Vx,Vy) of a difference value Δ as in Equation 28. In other words, the displacement vectors Vx and Vy when ϕ(Vx,Vy) is minimum as in Equation 29 may be determined, and may be determined by using a local maximum value or a local minimum value of ϕ(Vx,Vy).

$\begin{matrix} \begin{matrix} {{\Phi\left( {{Vx},{Vy}} \right)} =} & {= {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}\Delta_{i^{\prime}j^{\prime}}^{2}}} \\ {=} & {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}\left( {{P\; 0\left( {i^{\prime},j^{\prime}} \right)} - {P\; 1\left( {i^{\prime},j^{\prime}} \right)} +} \right.} \\  & {{{{Vx}\left( {i,j} \right)}\left( {{{\tau 0}*\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 1}*\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}}} \right)} +} \\  & \left. {{Vy}\left( {i,j} \right)\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}} \right)} \right)^{2} \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 28} \right\rbrack \\ {\mspace{76mu}{\left( {{Vx},{Vy}} \right) = {{argmin}_{{Vx},{Vy}}{\Phi\left( {{Vx},{Vy}} \right)}}}} & \left\lbrack {{Equation}\mspace{14mu} 29} \right\rbrack \end{matrix}$

ϕ(Vx,Vy) is a function using the displacement vectors Vx and Vy as parameters, and the local maximum value or the local minimum value may be determined by calculating a value that becomes 0 by partially differentiating ϕ(Vx,Vy) with respect to the displacement vectors Vx and Vy as in Equation 30.

$\begin{matrix} {{\frac{\partial{\Phi\left( {{Vx},{Vy}} \right)}}{\partial({Vx})} = 0};{\frac{\partial{\Phi\left( {{Vx},{Vy}} \right)}}{\partial({Vy})} = 0}} & \left\lbrack {{Equation}\mspace{14mu} 30} \right\rbrack \end{matrix}$

In other words, the displacement vectors Vx and Vy that minimize ϕ(Vx,Vy) may be determined. In order to solve optimization issues, minimization may be first performed in a vertical direction and then in a horizontal direction. According to the minimization, the displacement vector Vx may be determined according to Equation 31.

$\begin{matrix} {{Vx} = {\left( {{s\; 1} + r} \right) > {{m?\mspace{14mu}{clip}}\; 3\left( {{- {thBIO}},{thBIO},{- \frac{s\; 3}{{s\; 1} + r}}} \right)\text{:}\mspace{14mu} 0}}} & \left\lbrack {{Equation}\mspace{14mu} 31} \right\rbrack \end{matrix}$

Here, a function clip3(x, y, z) is a function that outputs x when z<x, outputs y when z>y, and outputs z when x<z<y. According to Equation 31, when s1+r>m, the displacement vector Vx may be clip3(−thBIO,thBIO,−s3/(s1+r)), and when not s1+r>m, the displacement vector Vx may be 0.

According to the minimization, the displacement vector Vy may be determined according to Equation 32.

$\begin{matrix} {{Vy} = {\left( {{s\; 5} + r} \right) > {{m?\mspace{14mu}{clip}}\; 3\left( {{- {thBIO}},{thBIO},{- \frac{{s\; 6} - {{Vx}*s\; 2\text{/}2}}{{s\; 5} + r}}} \right)\text{:}\mspace{14mu} 0}}} & \left\lbrack {{Equation}\mspace{14mu} 32} \right\rbrack \end{matrix}$

Here, a function clip3(x, y, z) ix a function that outputs x when z<x, outputs y when z>y, and outputs z when x<z<y. According to Equation 32, when s5+r>m, the displacement vector Vy may be clip3(−thBIO,thBIO,−(s6−Vx*s2)/2/(s5+r), and when not s5+r>m, the displacement vector Vy may be 0.

Here, s1, s2, s3, and s5 may be determined according to Equation 33.

$\begin{matrix} {\mspace{76mu}{{{s\; 1} = {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}}} \right)^{2}}}{{s\; 2} = {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}{\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}}} \right)\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}} \right)}}}{{s\; 3} = {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}{\left( {{P\; 1\left( {i^{\prime},j^{\prime}} \right)} - {P\; 0\left( {i^{\prime},j^{\prime}} \right)}} \right)\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial x}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial x}}} \right)}}}\mspace{76mu}{{s\; 5} = {{\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}{\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}} \right)^{2}s\; 6}} = {- {\sum\limits_{i^{\prime},{j^{\prime} \in {\Omega\;{ij}}}}{\left( {{P\; 1\left( {i^{\prime},j^{\prime}} \right)} - {P\; 0\left( {i^{\prime},j^{\prime}} \right)}} \right)\left( {{{\tau 0}\frac{{\partial P}\; 0\left( {i^{\prime},j^{\prime}} \right)}{\partial y}} + {{\tau 1}\frac{{\partial P}\; 1\left( {i^{\prime},j^{\prime}} \right)}{\partial y}}} \right)}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 33} \right\rbrack \end{matrix}$

As described above, r and m may be normalization parameters introduced to avoid a division result value being 0 or smaller and determined according to Equation 34 based on an internal bit depth d of an input video. r=500*4^(d-8) m=700*4^(d-8)  [Equation 34]

The displacement vectors Vx and Vy may have an upper limit and a lower limit of ±thBIO. The displacement vectors Vx and Vy may be clipped by a certain threshold value thBIO since there may be cases where motion compensation in pixel units may not be trusted due to noise or irregular motion. thBIO may be determined based on whether directions of all reference pictures are the same. For example, when the directions of all reference pictures are the same, thBIO may be determined to be 12*2{circumflex over ( )}(14−d). When the directions of all reference pictures are different, thBIO may be determined to be 12*2{circumflex over ( )}(13−d).

FIG. 9 is a diagram for describing processes of adding an offset value after filtering is performed, and determining a gradient value in a horizontal or vertical direction by performing inverse-scaling, according to an embodiment.

Referring to FIG. 9, the video decoding apparatus 100 may determine a gradient value in a horizontal or vertical direction by performing filtering on a pixel, in which a component in a certain direction is at an integer position, by using a first 1D filter and a second 1D filter. However, a value obtained by performing the filtering on the pixel, in which the component in the certain direction is at an integer position, by using the first 1D filter or the second 1D filter may be outside a certain range. Such a phenomenon is referred to as an overflow phenomenon. Coefficients of a 1D filter may be determined to be an integer for integer operation instead of an inaccurate and complicated fractional operation. The coefficients of the 1D filter may be scaled to be determined as an integer. When filtering is performed by using the scaled coefficients of the 1D filter, it is possible to perform an integer operation, but compared to when filtering is performed by using an un-scaled coefficients of a 1D filter, a size of a value on which the filtering is performed may be high and an overflow phenomenon may occur. Accordingly, in order to prevent an overflow phenomenon, de-scaling may be performed after the filtering is performed by using the 1D filter. Here, the de-scaling may include bit-shifting to the right by a de-scaling bit number. The de-scaling bit number may be determined considering a maximum bit number of a register for a filtering operation and a maximum bit number of a temporal buffer that stores a filtering result, while maximizing accuracy of calculation. In particular, the de-scaling bit number may be determined based on an internal bit depth, a scaling bit number of an interpolation filter, and a scaling bit number for a gradient filter.

Hereinafter, performing of de-scaling during processes of generating an interpolation filtering value in a vertical direction by first performing filtering on a pixel at an integer position by using an interpolation filter in the vertical direction so as to determine a gradient value in a horizontal direction and then performing filtering on the interpolation filtering value in the vertical direction by using a gradient filter in the horizontal direction will be described.

According to Equation 12 above, the video decoding apparatus 100 may first perform filtering on a pixel at an integer position by using an interpolation filter in a vertical direction so as to determine a gradient value in a horizontal direction. Here, shift₁ may be b−8. Here, b may denote an internal bit depth of an input image. Hereinafter, a bit depth (Reg Bitdepth) of a register and a bit depth (Temp Bitdepth) of a temporary buffer when de-scaling is actually performed based on shift₁ will be described with reference to Table 1.

TABLE 1 Reg Temp b Min (I) Max (I) RegMax RegMin Bitdepth TempMax TempMin Bitdepth 8 0 255 22440 −6120 16 22440 −6121 16 9 0 511 44968 −12264 17 22484 −6133 16 10 0 1023 90024 −24552 18 22506 −6139 16 11 0 2047 180136 −49128 19 22517 −6142 16 12 0 4095 360360 −98280 20 22523 −6143 16 16 0 65535 5767080 −1572840 24 22528 −6145 16

Here, a value of a variable in Table 1 may be determined according to Equation 35. RegMin=Min(I)*FilterSumPos+Max(I)*FilterSumNeg RegMax=Max(I)*FilterSumPos+Min(I)*FilterSumNeg Reg BitDepth=ceiling(log₂(RegMax−RegMin)+1) TempMin=(RegMin+offset1)>>shift1 TempMax=(RegMax+offset1)>>shift1 Temp BitDepth=ceiling(log₂(TempMax−TempMin)+1)  [Equation 35]

Here, Min(I) may denote a minimum value of a pixel value I determined by an internal bit depth, and Max(I) may denote a maximum value of the pixel value I determined by the internal bit depth. FilterSumPos denotes a maximum value of the sum of positive filter coefficients, and FilterSumNeg denotes a minimum value of the sum of negative filter coefficients.

For example, when a gradient filter FracFilter in ¼ pel units in FIG. 7C is used, FilterSumPos may be 88 and FilterSumNeg may be −24.

A function Celing(x) may be a function outputting a smallest integer from among integers equal to or higher than x, with respect to a real number x. offset₁ is an offset value added to a value on which filtering is performed so as to prevent a round-off error that may be generated while performing de-scaling using shift₁, and offset₁ may be determined to be 2{circumflex over ( )}(shift₁−1).

Referring to Table 1, when the internal bit depth b is 8, the bit depth (Reg Bitdepth) of the register may be 16, when the internal bit depth b is 9, the bit depth of the register may be 17, and when the internal bit depth b is 10, 11, 12, and 16, the bit depth of the register may be 18, 19, and 24. When a register used to preform filtering is a 32-bit register, since bit depths of all registers in FIG. 1 do not exceed 32, an overflow phenomenon does not occur.

Similarly, when the internal bit depths b are 8, 9, 10, 11, 12, and 16, the bit depths (Temp BitDepth) of the temporary buffers are all 16. When a temporary buffer used to store a value on which filtering is performed and then de-scaling is performed is a 16-bit buffer, since bit depths of all temporary buffers in Table 1 are 16 and thus do not exceed 16, an overflow phenomenon does not occur.

According to Equation 12, the video decoding apparatus 100 may generate an interpolation filtering value in a vertical direction by first performing filtering on a pixel at an integer position by using an interpolation filtering in the vertical direction so as to determine a gradient value in a horizontal direction, and then perform filtering on the interpolation filtering value in the vertical direction by using a gradient filter in the horizontal direction, according to Equation 13. Here, shift₂ may be determined to be p+q−shift₁. Here, p may denote a bit number scaled with respect to an interpolation filter including filter coefficients shown in FIG. 7C, and q may denote a bit number scaled with respect to a gradient filter including filter coefficients shown in FIG. 7A. For example, p may be 6 and q may be 4, and accordingly, shift₂=18−b.

shift₂ is determined as such because shift₁+shift₂, i.e., the total sum of de-scaled bit numbers, should be the same as the sum (p+q) of bit numbers up-scaled with respect to a filter such that a final filtering result values are the same in a case when a filter coefficient is up-scaled and in a case when the filter coefficient is not up-scaled.

Hereinafter, a bit depth (Reg Bitdepth) of a register and a bit depth (Temp Bitdepth) of a temporary buffer when de-scaling is actually performed based on shift₂ will be described with reference to Table 2.

TABLE 2 Reg Temp b TempMin TempMax RegMax RegMin Bitdepth OutMax OutMin Bitdepth 8 −6121 22440 1942148 −1942148 23 1897 −1898 13 9 −6133 22484 1945956 −1945956 23 3801 −3802 14 10 −6139 22506 1947860 −1947860 23 7609 −7610 15 11 −6142 22517 1948812 −1948812 23 15225 −15226 16 12 −6143 22523 1949288 −1949288 23 30458 −30459 17 16 −6145 22528 1949764 −1949764 23 487441 −487442 21

Here, a value of a variable in Table 2 may be determined according to Equation 36. RegMin=TempMin*FilterSumPos+TempMax*FilterSumNeg RegMax=TempMax*FilterSumPos+TempMin*FilterSumNeg Reg BitDepth=ceiling(log₂(RegMax−RegMin)+1) TempMin=(RegMin+offset2)>>shift2 TempMax=(RegMax+offset2)>>shift2 Temp BitDepth=ceiling(log₂(TempMax−TempMin)+1)  [Equation 36]

Here, TempMax may denotes TempMax of Table 1 and TempMin may denote TempMin of Table 1. FilterSumPos denotes a maximum value of the sum of positive filter coefficients and FilterSumNeg denotes a minimum value of the sum of negative filter coefficients. For example, when a gradient filter gradFilter in ¼ pel units shown in FIG. 7C is used, FilterSumPos may be 68 and FilterSumNeg may be −68.

offset₂ is an offset value added to a value on which filtering is performed so as to prevent a round-off error that may be generated while performing de-scaling using shift₂, and offset₁ may be determined to be 2{circumflex over ( )}(shift₂−1).

shift₁ and shift₂ may be determined as such, but alternatively, shift₁ and shift₂ may be variously determined as long as the sum of shift₁ and shift₂ is equal to the sum of scaling bit numbers. Here, values of shift₁ and shift₂ may be determined based on the premise that an overflow phenomenon does not occur. shift₂ and shift₂ may be determined based on an internal bit depth of an input image and a scaling bit number with respect to a filter.

However, shift₁ and shift₂ may not be necessarily determined such that the sum of shift₁ and shift₂ is equal to the num of scaling bit numbers with respect to a filter. For example, shift₁ may be determined to be d−8, but shift₂ may be determined to be a fixed number.

When shift₁ is the same as previous and shift₂ is a fixed number of 7, OutMax, OutMin, and Temp Bitdepth described with reference to Table 2 may be changed. Hereinafter, a bit depth (Temp Bitdepth) of a temporary buffer will now be described with reference to Table 3.

TABLE 3 b OutMax OutMin Temp Bitdepth 8 15173 −15174 16 9 15203 −15204 16 10 15218 −15219 16 11 15225 −15226 16 12 15229 −15230 16 16 15233 −15234 16

Unlike Table 2, in Table 3, the bit depths (Temp Bitdepth) of the temporary buffers are the same, i.e., 16, in all b, and when result data is stored by using a 16-bit temporary buffer, the bit depth (Temp Bitdepth) of the temporary buffer is smaller than 16, and thus an overflow phenomenon does not occur with respect to internal bit depths of all input images. Meanwhile, referring to Table 2, when internal bit depths of input images are 12 and 16, and result data is stored by using a 16-bit temporary buffer, the bit depth (Temp Bitdepth) of the temporary buffer is higher than 16, and thus an overflow phenomenon may occur.

When shift₂ is a fixed number, a scaled filter coefficient is not used, and a result value of performing filtering and a result value of performing filtering and then de-scaling may be different. In this case, it would be obvious to one of ordinary skill in the art that de-scaling needs to be additionally performed.

Hereinabove, performing of de-scaling during processes of generating an interpolation filtering value in a vertical direction by first performing filtering on a pixel at an integer position by using an interpolation filter in the vertical direction so as to determine a gradient value in a horizontal direction, and then performing filtering on the interpolation filtering value in the vertical direction by using a gradient filter in the horizontal direction has been described, but it would be obvious to one of ordinary skill in the art that de-scaling may be performed in the similar manner when filtering is performed on a pixel, in which a component in a certain direction is an integer, so as to determine gradient values in horizontal and vertical directions via a combination of various 1D filters.

Hereinafter, a method of determining a data unit that may be used while the video decoding apparatus 100 according to an embodiment decodes an image will be described with reference to FIGS. 10 through 23. Operations of the video encoding apparatus 150 may be similar to or the reverse of various embodiments of operations of the video decoding apparatus 100 described below.

FIG. 10 illustrates processes of determining at least one coding unit as the video decoding apparatus 100 splits a current coding unit, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine a shape of a coding unit by using block shape information, and determine a shape into which a coding unit is split by using split shape information. In other words, a split method of a coding unit, which is indicated by the split shape information, may be determined based on a block shape indicated by the block shape information used by the video decoding apparatus 100.

According to an embodiment, the video decoding apparatus 100 may use block shape information indicating that a current coding unit has a square shape. For example, the video decoding apparatus 100 may determine, according to split shape information, whether to not split a square coding unit, to split the square coding unit vertically, to split the square coding unit horizontally, or to split the square coding unit into four coding units. Referring to FIG. 10, when block shape information of a current coding unit 1000 indicates a square shape, the video decoding apparatus 100 may not split a coding unit 1010 a having the same size as the current coding unit 1000 according to split shape information indicating non-split, or determine coding units 1010 b, 1010 c, or 1010 d based on split shape information indicating a certain split method.

Referring to FIG. 10, the video decoding apparatus 100 may determine two coding units 1010 b by splitting the current coding unit 1000 in a vertical direction based on split shape information indicating a split in a vertical direction, according to an embodiment. The video decoding apparatus 100 may determine two coding units 1010 c by splitting the current coding unit 1000 in a horizontal direction based on split shape information indicating a split in a horizontal direction. The video decoding apparatus 100 may determine four coding units 1010 d by splitting the current coding unit 1000 in vertical and horizontal directions based on split shape information indicating splitting in vertical and horizontal directions. However, a split shape into which a square coding unit may be split is not limited to the above shapes, and may include any shape indicatable by split shape information. Certain split shapes into which a square coding unit are split will now be described in detail through various embodiments.

FIG. 11 illustrates processes of determining at least one coding unit when the video decoding apparatus 100 splits a coding unit having a non-square shape, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may use block shape information indicating that a current coding unit has a non-square shape. The video decoding apparatus 100 may determine, according to split shape information, whether to not split the non-square current coding unit or to split the non-square current coding unit via a certain method. Referring to FIG. 11, when block shape information of a current coding unit 1100 or 1150 indicates a non-square shape, the video decoding apparatus 100 may not split coding units 1110 or 1160 having the same size as the current coding unit 1100 or 1150 according to split shape information indicating non-split, or determine coding units 1120 a, 1120 b, 1130 a, 1130 b, 1130 c, 1170 a, 1170 b, 1180 a, 1180 b, and 1180 c based on split shape information indicating a certain split method. A certain split method of splitting a non-square coding unit will now be described in detail through various embodiments.

According to an embodiment, the video decoding apparatus 100 may determine a shape into which a coding unit is split by using split shape information, and in this case, the split shape information may indicate the number of at least one coding unit generated as the coding unit is split. Referring to FIG. 11, when split shape information indicates that the current coding unit 1100 or 1150 is split into two coding units, the video decoding apparatus 100 may determine two coding units 1120 a and 1120 b or 1170 a and 1170 b included in the current coding unit 1100 or 1150 by splitting the current coding unit 1100 or 1150 based on the split shape information.

According to an embodiment, when the video decoding apparatus 100 splits the current coding unit 1100 or 1150 having a non-square shape based on split shape information, the video decoding apparatus 100 may split the current coding unit 1100 or 1150 considering locations of long sides of the current coding unit 1100 or 1150 having a non-square shape. For example, the video decoding apparatus 100 may determine a plurality of coding units by splitting the current coding unit 1100 or 1150 in a direction of splitting the long sides of the current coding unit 1100 or 1150 considering a shape of the current coding unit 1100 or 1150.

According to an embodiment, when split shape information indicates that a coding unit is split into an odd number of blocks, the video decoding apparatus 100 may determine the odd number of coding units included in the current coding unit 1100 or 1150. For example, when split shape information indicates that the current coding unit 1100 or 1150 is split into three coding units, the video decoding apparatus 100 may split the current coding unit 1100 or 1150 into three coding units 1130 a through 1130 c or 1180 a through 1180 c. According to an embodiment, the video decoding apparatus 100 may determine the odd number of coding units included in the current coding unit 1100 or 1150, and the sizes of the determined coding units may not be all the same. For example, the size of coding unit 1130 b or 1180 b from among the determined odd number of coding units 1130 a through 1130 c or 1180 a through 1180 c may be different from the sizes of coding units 1130 a and 1130 c or 1180 a and 1180 c. In other words, coding units that may be determined when the current coding unit 1100 or 1150 is split may have a plurality of types of sizes, and in some cases, the coding units 1130 a through 1130 c or 1180 a through 1180 c may have different sizes.

According to an embodiment, when split shape information indicates that a coding unit is split into an odd number of blocks, the video decoding apparatus 100 may determine the odd number of coding units included in the current coding unit 1100 or 1150, and in addition, may set a certain limit on at least one coding unit from among the odd number of coding units generated via splitting. Referring to FIG. 11, the video decoding apparatus 100 may differentiate decoding processes performed on the coding unit 1130 b or 1180 b located at the center from among the three coding units 1130 a through 1130 c or 1180 a through 1180 c generated as the current coding unit 1100 or 1150 is split from the other coding units 1130 a and 1130 c or 1180 a and 1180 c. For example, the video decoding apparatus 100 may limit the coding unit 1130 b or 1180 b located at the center to be no longer split unlike the other coding units 1130 a and 1130 c or 1180 a and 1180 c, or to be split only a certain number of times.

FIG. 12 illustrates processes of the video decoding apparatus 100 splitting a coding unit, based on at least one of a block shape information and split shape information, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine that a first coding unit 1200 having a square shape is split or not split into coding units, based on at least one of block shape information and split shape information. According to an embodiment, when split shape information indicates that the first coding unit 1200 is split in a horizontal direction, the video decoding apparatus 100 may determine a second coding unit 1210 by splitting the first coding unit 1200 in a horizontal direction. A first coding unit, a second coding unit, and a third coding unit used according to an embodiment are terms used to indicate a relation between before and after splitting a coding unit. For example, a second coding unit may be determined by splitting a first coding unit, and a third coding unit may be determined by splitting a second coding unit. Hereinafter, it will be understood that relations between first through third coding units are in accordance with the features described above.

According to an embodiment, the video decoding apparatus 100 may determine that the determined second coding unit 1210 is split or not split into coding units based on at least one of block shape information and split shape information. Referring to FIG. 12, the video decoding apparatus 100 may split the second coding unit 1210, which has a non-square shape and is determined by splitting the first coding unit 1200, into at least one third coding unit 1210 a, 1220 b, 1220 c, or 1220 d, or may not split the second coding unit 1210, based on at least one of block shape information and split shape information. The video decoding apparatus 100 may obtain at least one of the block shape information and the split shape information, and obtain a plurality of second coding units (for example, the second coding units 1210) having various shapes by splitting the first coding unit 1200 based on at least one of the obtained block shape information and split shape information, wherein the second coding unit 1210 may be split according to a method of splitting the first coding unit 1200 based on at least one of the block shape information and the split shape information. According to an embodiment, when the first coding unit 1200 is split into the second coding units 1210 based on at least one of block shape information and split shape information with respect to the first coding unit 1200, the second coding unit 1210 may also be split into third coding units (for example, the third coding units 1220 a through 1220 d) based on at least one of block shape information and split shape information with respect to the second coding unit 1210. In other words, a coding unit may be recursively split based on at least one of split shape information and block shape information related to each coding unit. Accordingly, a square coding unit may be determined from a non-square coding unit, and such a square coding unit may be recursively split such that a non-square coding unit is determined. Referring to FIG. 12, a certain coding unit (for example, a coding unit located at the center or a square coding unit) from among the odd number of third coding units 1220 b through 1220 d determined when the second coding unit 1210 having a non-square shape is split may be recursively split. According to an embodiment, the third coding unit 1220 c having a square shape from among the third coding units 1220 b through 1220 d may be split in a horizontal direction into a plurality of fourth coding units. A fourth coding unit 1240 having a non-square shape from among the plurality of fourth coding units may again be split into a plurality of coding units. For example, the fourth coding unit 1240 having a non-square shape may be split into an odd number of coding units 1250 a through 1250 c.

A method that may be used to recursively split a coding unit will be described below through various embodiments.

According to an embodiment, the video decoding apparatus 100 may determine that each of the third coding units 1220 a through 1220 d is split into coding units or that the second coding unit 1210 is not split, based on at least one of block shape information and split shape information. The video decoding apparatus 100 may split the second coding unit 1210 having a non-square shape into the odd number of third coding units 1220 b through 1220 d, according to an embodiment. The video decoding apparatus 100 may set a certain limit on a certain third coding unit from among the third coding units 1220 b through 1220 d. For example, the video decoding apparatus 100 may limit that the third coding unit 1220 c located at the center of the third coding units 1220 b through 1220 d is no longer split, or is split into a settable number of times. Referring to FIG. 12, the video decoding apparatus 100 may limit that the third coding unit 1220 c located at the center of the third coding units 1220 b through 1220 d included in the second coding unit 1210 having a non-square shape is no longer split, is split into a certain split shape (for example, split into four coding units or split into shapes corresponding to those into which the second coding unit 1210 is split), or is split only a certain number of times (for example, split only n times wherein n>0). However, such limits on the third coding unit 1220 c located at the center are only examples and should not be interpreted as being limited by those examples, but should be interpreted as including various limits as long as the third coding unit 1220 c located at the center are decoded differently from the other third coding units 1220 b and 1220 d.

According to an embodiment, the video decoding apparatus 100 may obtain at least one of block shape information and split shape information used to split a current coding unit from a certain location in the current coding unit.

FIG. 13 illustrates a method of determining, by the video decoding apparatus 100, a certain coding unit from among an odd number of coding units, according to an embodiment. Referring to FIG. 13, at least one of block shape information and split shape information of a current coding unit 1300 may be obtained from a sample at a certain location (for example, a sample 1340 located at the center) from among a plurality of samples included in the current coding unit 1300. However, the certain location in the current coding unit 1300 from which at least one of block shape information and split shape information is obtained is not limited to the center location shown in FIG. 13, but may be any location (for example, an uppermost location, a lowermost location, a left location, a right location, an upper left location, a lower left location, an upper right location, or a lower right location) included in the current coding unit 1300. The video decoding apparatus 100 may determine that a current coding unit is split into coding units having various shapes and sizes or is not split by obtaining at least one of block shape information and split shape information from a certain location.

According to an embodiment, the video decoding apparatus 100 may select one coding unit when a current coding unit is split into a certain number of coding units. A method of selecting one of a plurality of coding units may vary, and details thereof will be described below through various embodiments.

According to an embodiment, the video decoding apparatus 100 may split a current coding unit into a plurality of coding units, and determine a coding unit at a certain location.

FIG. 13 illustrates a method of determining, by the video decoding apparatus 100, a coding unit at a certain location from among an odd number of coding units, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may use information indicating a location of each of the odd number of coding units so as to determine a coding unit located at the center from among the odd number of coding units. Referring to FIG. 13, the video decoding apparatus 100 may determine the odd number of coding units 1320 a through 1320 c by splitting the current coding unit 1300. The video decoding apparatus 100 may determine the center coding unit 1320 b by using information about the locations of the odd number of coding units 1320 a through 1320 c. For example, the video decoding apparatus 100 may determine the coding unit 1320 b located at the center by determining the locations of the coding units 1320 a through 1320 b based on information indicating locations of certain samples included in the coding units 1320 a through 1320 c. In detail, the video decoding apparatus 100 may determine the coding unit 1320 b located at the center by determining the locations of the coding units 1320 a through 1320 c based on information indicating locations of upper left samples 1330 a through 1330 c of the coding units 1320 a through 1320 c.

According to an embodiment, the information indicating the locations of the upper left samples 1330 a through 1330 c included in the coding units 1320 a through 1320 c respectively may include information about a location or coordinates of the coding units 1320 a through 1320 c in a picture. According to an embodiment, the information indicating the locations of the upper left samples 1330 a through 1330 c included in the coding units 1320 a through 1320 c respectively may include information indicating widths or heights of the coding units 1320 a through 1320 c included in the current coding unit 1300, and such widths or heights may correspond to information indicating differences between coordinates of the coding units 1320 a through 1320 c in a picture. In other words, the video decoding apparatus 100 may determine the coding unit 1320 b located at the center by directly using the information about the locations or coordinates of the coding units 1320 a through 1320 c in a picture or by using information about the widths or heights of the coding units 1320 a through 1320 c corresponding to the differences between coordinates.

According to an embodiment, the information indicating the location of the upper left sample 1330 a of the upper coding unit 1320 a may indicate (xa, ya) coordinates, the information indicating the location of the upper left sample 1330 b of the center coding unit 1320 b may indicate (xb, yb) coordinates, and the information indicating the location of the upper left sample 1330 c of the lower coding unit 1320 c may indicate (xc, yc) coordinates. The video decoding apparatus 100 may determine the center coding unit 1320 b by using the coordinates of the upper left samples 1330 a through 1330 c respectively included in the coding units 1320 a through 1320 c. For example, when the coordinates of the upper left samples 1330 a through 1330 c are arranged in an ascending order or descending order, the coding unit 1320 b including the coordinates (xb, yb) of the sample 1330 b located at the center may be determined as a coding unit located at the center from among the coding units 1320 a through 1320 c determined when the current coding unit 1300 is split. However, coordinates indicating the locations of the upper left samples 1330 a through 1330 c may be coordinates indicating absolute locations in a picture, and in addition, (dxb, dyb) coordinates, i.e., information indicating a relative location of the upper left sample 1330 b of the center coding unit 1320 b, and (dxc, dyc) coordinates, i.e., information indicating a relative location of the upper left sample 1330 c of the lower coding unit 1320 c, may be used based on the location of the upper left sample 1330 a of the upper coding unit 1320 a. Also, a method of determining a coding unit at a certain location by using, as information indicating locations of samples included in coding units, coordinates of the samples is not limited to the above, and various arithmetic methods capable of using coordinates of samples may be used.

According to an embodiment, the video decoding apparatus 100 may split the current coding unit 1300 into the plurality of coding units 1320 a through 1320 c, and select a coding unit from the coding units 1320 a through 1320 c according to a certain standard. For example, the video decoding apparatus 100 may select the coding unit 1320 b having a different size from among the coding units 1320 a through 1320 c.

According to an embodiment, the video decoding apparatus 100 may determine widths or heights of the coding units 1320 a through 1320 c by respectively using the (xa, ya) coordinates, i.e., the information indicating the location of the upper left sample 1330 a of the upper coding unit 1320 a, the (xb, yb) coordinates, i.e., the information indicating the location of the upper left sample 1330 b of the center coding unit 1320 b, and the (xc, yc) coordinates, i.e., the information indicating the location of the upper left sample 1330 c of the lower coding unit 1320 c. The video decoding apparatus 100 may determine the sizes of the coding units 1320 a through 1320 c by respectively using the coordinates (xa, ya), (xb, yb), and (xc, yc) indicating the locations of the coding units 1320 a through 1320 c.

According to an embodiment, the video decoding apparatus 100 may determine the width of the upper coding unit 1320 a to be xb−xa, and the height to be yb−ya. According to an embodiment, the video decoding apparatus 100 may determine the width of the center coding unit 1320 b to be xc−xb, and the height to be yc−yb. According to an embodiment, the video decoding apparatus 100 may determine the width or height of the lower coding unit 1320 c by using the width and height of the current coding unit 1300 and the widths and heights of the upper coding unit 1320 a and center coding unit 1320 b. The video decoding apparatus 100 may determine a coding unit having a different size from other coding units based on the determined widths and heights of the coding units 1320 a through 1320 c. Referring to FIG. 13, the video decoding apparatus 100 may determine the center coding unit 1320 b having a size different from those of the upper coding unit 1320 a and lower coding unit 1320 c as a coding unit at a certain location. However, processes of the video decoding apparatus 100 determining a coding unit having a different size from other coding units are only an example of determining a coding unit at a certain location by using sizes of coding units determined based on sample coordinates, and thus various processes of determining a coding unit at a certain location by comparing sizes of coding units determined according to certain sample coordinates may be used.

However, a location of a sample considered to determine a location of a coding unit is not limited to the upper left as described above, and information about a location of an arbitrary sample included in a coding unit may be used.

According to an embodiment, the video decoding apparatus 100 may select a coding unit at a certain location from among an odd number of coding units determined when a current coding unit is split, while considering a shape of the current coding unit. For example, when the current coding unit has a non-square shape in which a width is longer than a height, the video decoding apparatus 100 may determine a coding unit at a certain location in a horizontal direction. In other words, the video decoding apparatus 100 may determine one of coding units having a different location in the horizontal direction and set a limit on the one coding unit. When the current coding unit has a non-square shape in which a height is longer than a width, the video decoding apparatus 100 may determine a coding unit at a certain location in a vertical direction. In other words, the video decoding apparatus 100 may determine one of coding units having a different location in the vertical direction and set a limit on the one coding unit.

According to an embodiment, the video decoding apparatus 100 may use information indicating a location of each of an even number of coding units so as to determine a coding unit at a certain location from among the even number of coding units. The video decoding apparatus 100 may determine the even number of coding units by splitting a current coding unit, and determine the coding unit at the certain location by using information about the locations of the even number of coding units. Detailed processes thereof may correspond to those of determining a coding unit at a certain location (for example, a center location) from among an odd number of coding units described in FIG. 13, and thus details thereof are not provided again.

According to an embodiment, when a current coding unit having a non-square shape is split into a plurality of coding units, certain information about a coding unit at a certain location during splitting processes may be used to determine the coding unit at the certain location from among the plurality of coding units. For example, the video decoding apparatus 100 may use at least one of block shape information and split shape information stored in a sample included in a center coding unit during splitting processes so as to determine a coding unit located at the center from among a plurality of coding units obtained by splitting a current coding unit.

Referring to FIG. 13, the video decoding apparatus 100 may split the current coding unit 1300 into the plurality of coding units 1320 a through 1320 c based on at least one of block shape information and split shape information, and determine the coding unit 1320 b located at the center from among the plurality of coding units 1320 a through 1320 c. In addition, the video decoding apparatus 100 may determine the coding unit 1320 b located at the center considering a location from which at least one of the block shape information and the split shape information is obtained. In other words, at least one of the block shape information and the split shape information of the current coding unit 1300 may be obtained from the sample 1340 located at the center of the current coding unit 1300, and when the current coding unit 1300 is split into the plurality of coding units 1320 a through 1320 c based on at least one of the block shape information and the split shape information, the coding unit 1320 b including the sample 1340 may be determined as a coding unit located at the center. However, information used to determine a coding unit located at the center is not limited to at least one of the block shape information and the split shape information, and various types of information may be used while determining a coding unit located at the center.

According to an embodiment, certain information for identifying a coding unit at a certain location may be obtained from a certain sample included in a coding unit to be determined. Referring to FIG. 13, the video decoding apparatus 100 may use at least one of block shape information and split shape information obtained from a sample at a certain location in the current coding unit 1300 (for example, a sample located at the center of the current coding unit 1300), so as to determine a coding unit at a certain location (for example, a coding unit located at the center from among a plurality of coding units) from among the plurality of coding units 1320 a through 1320 c determined when the current coding unit 1300 is split. In other words, the video decoding apparatus 100 may determine the sample at the certain location considering a block shape of the current coding unit 1300, and determine and set a certain limit on the coding unit 1320 b including a sample from which certain information (for example, at least one of block shape information and split shape information) is obtainable, from among the plurality of coding units 1320 a through 1320 c determined when the current coding unit 1300 is split. Referring to FIG. 13, according to an embodiment, the video decoding apparatus 100 may determine, as a sample from which certain information is obtainable, the sample 1340 located at the center of the current coding unit 1300, and set a certain limit on the coding unit 1320 b including such a sample 1340 during decoding processes. However, a location of a sample from which certain information is obtainable is not limited to the above, and may be a sample at an arbitrary location included in the coding unit 1320 b determined to set a limit.

According to an embodiment, a location of a sample from which certain information is obtainable may be determined according to a shape of the current coding unit 1300. According to an embodiment, block shape information may determine whether a shape of a current coding unit is square or non-square, and determine a location of a sample from which certain information is obtainable according to the shape. For example, the video decoding apparatus 100 may determine, as a sample from which certain information is obtainable, a sample located on a boundary of splitting at least one of a width and a height of a current coding unit into halves by using at least one of information about the width of the current coding unit and information about the height of the current coding unit. As another example, when block shape information related to a current coding unit indicates a non-square shape, the video decoding apparatus 100 may determine, as a sample from which certain information is obtainable, one of samples adjacent to a boundary of splitting long sides of the current coding unit into halves.

According to an embodiment, when a current coding unit is split into a plurality of coding units, the video decoding apparatus 100 may use at least one of block shape information and split shape information so as to determine a coding unit at a certain location from among the plurality of coding units. According to an embodiment, the video decoding apparatus 100 may obtain at least one of block shape information and split shape information from a sample at a certain location included in a coding unit, and may split a plurality of coding units generated as a current coding unit is split by using at least one of the split shape information and the block shape information obtained from the sample at the certain location included in each of the plurality of coding units. In other words, a coding unit may be recursively split by using at least one of block shape information and split shape information obtained from a sample at a certain location included in each coding unit. Since processes of recursively splitting a coding unit have been described above with reference to FIG. 12, details thereof are not provided again.

According to an embodiment, the video decoding apparatus 100 may determine at least one coding unit by splitting a current coding unit, and determine an order of decoding the at least one coding unit according to a certain block (for example, the current coding unit).

FIG. 14 illustrates an order of processing a plurality of coding units when the plurality of coding units are determined when the video decoding apparatus 100 splits a current coding unit, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine second coding units 1410 a and 1410 b by splitting a first coding unit 1400 in a vertical direction, determine second coding units 1430 a and 1430 b by splitting the first coding unit 1400 in a horizontal direction, or determine second coding units 1450 a through 1450 d by splitting the first coding unit 140 in horizontal and vertical directions, according to block shape information and split shape information.

Referring to FIG. 14, the video decoding apparatus 100 may determine the second coding units 1410 a and 1410 b, which are determined by splitting the first coding unit 1400 in the vertical direction, to be processed in a horizontal direction 1410 c. The video decoding apparatus 100 may determine the second coding units 1430 a and 1430 b, which are determined by splitting the first coding unit 1400 in the horizontal direction, to be processed in a vertical direction 1430 c. The video decoding apparatus 100 may determine the second coding units 1450 a through 1450 d, which are determined by splitting the first coding unit 1400 in the vertical and horizontal directions, to be processed) according to a certain order in which coding units located in one row is processed and then coding units located in a next row is processed (for example, a raster scan order or a z-scan order 1450 e).

According to an embodiment, the video decoding apparatus 100 may recursively split coding units. Referring to FIG. 14, the video decoding apparatus 100 may determine the plurality of second coding units 1410 a and 1410 b, 1430 a and 1430 b, or 1450 a through 1450 d by splitting the first coding unit 1400, and recursively split each of the plurality of second coding units 1410 a and 1410 b, 1430 a and 1430 b, or 1450 a through 1450 d. A method of splitting the plurality of second coding units 1410 a and 1410 b, 1430 a and 1430 b, or 1450 a through 1450 d may correspond to a method of splitting the first coding unit 1400. Accordingly, each of the plurality of second coding units 1410 a and 1410 b, 1430 a and 1430 b, or 1450 a through 1450 d may be independently split into a plurality of coding units. Referring to FIG. 14, the video decoding apparatus 100 may determine the second coding units 1410 a and 1410 b by splitting the first coding unit 1400 in the vertical direction, and in addition, determine that each of the second coding units 1410 a and 1410 b is independently split or not split.

According to an embodiment, the video decoding apparatus 100 may split the second coding unit 1410 a at the left in a horizontal direction into third coding units 1420 a and 1420 b, and may not split the second coding unit 1410 b at the right.

According to an embodiment, an order of processing coding units may be determined based on split processes of coding units. In other words, an order of processing coding units that are split may be determined based on an order of processing coding units before being split. The video decoding apparatus 100 may determine an order of processing the third coding units 1420 a and 1420 b determined when the second coding unit 1410 a at the left is split independently from the second coding unit 1410 b at the right. Since the third coding units 1420 a and 1420 b are determined when the second coding unit 1410 a at the left is split in a horizontal direction, the third coding units 1420 a and 1420 b may be processed in a vertical direction 1420 c. Also, since an order of processing the second coding unit 1410 a at the left and the second coding unit 1410 b at the right corresponds to the horizontal direction 1410 c, the second coding unit 1410 b at the right may be processed after the third coding units 1420 a and 1420 b included in the second coding unit 1410 a at the left are processed in the vertical direction 1420 c. The above descriptions are related processes of determining an order of processing coding units according to coding units before being split, but such processes are not limited to the above embodiments, and any method of independently processing, in a certain order, coding units split into various shapes may be used.

FIG. 15 illustrates processes of determining that a current coding unit is split into an odd number of coding units when coding units are not processable in a certain order by the video decoding apparatus 100, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine that a current coding unit is split into an odd number of coding units based on obtained block shape information and split shape information. Referring to FIG. 15, a first coding unit 1500 having a square shape may be split into second coding units 1510 a and 1510 b having a non-square shape, and the second coding units 1510 a and 1510 b may be independently respectively split into third coding units 1520 a and 1520 b, and 1520 c through 1520 e. According to an embodiment, the video decoding apparatus 100 may split the second coding unit 1510 a at the left from among the second coding units 1510 a and 1510 b into a horizontal direction to determine the plurality of third coding units 1520 a and 1520 b, and split the second coding unit 1510 b at the right into the odd number of third coding units 1520 c through 1520 e.

According to an embodiment, the video decoding apparatus 100 may determine whether a coding unit split into an odd number exists by determining whether the third coding units 1520 a through 1520 e are processable in a certain order. Referring to FIG. 15, the video decoding apparatus 100 may determine the third coding units 1520 a through 1520 e by recursively splitting the first coding unit 1500. The video decoding apparatus 100 may determine, based on at least one of block shape information and split shape information, whether a coding unit is split into an odd number from among shapes into which the first coding unit 1500, the second coding units 1510 a and 1510 b, or the third coding units 1520 a through 1520 e are split. For example, the second coding unit 1510 b at the right from among the second coding units 1510 a and 1510 b may be split into the odd number of third coding units 1520 c through 1520 e. An order of processing a plurality of coding units included in the first coding unit 1500 may be a certain order (for example, a z-scan order 1530), and the video decoding apparatus 100 may determine whether the third coding units 1520 c through 1520 e determined when the second coding unit 1510 b at the right is split into an odd number satisfy a condition of being processable according to the certain order.

According to an embodiment, the video decoding apparatus 100 may determine whether the third coding units 1520 a through 1520 e included in the first coding unit 1500 satisfy a condition of being processable according to a certain order, wherein the condition is related to whether at least one of a width and a height of each of the second coding units 1510 a and 1510 b is split into halves according to boundaries of the third coding units 1520 a through 1520 e. For example, the third coding units 1520 a and 1520 b determined when the height of the second coding unit 1510 a at the left and having a non-square shape is split into halves satisfy the condition, but it may be determined that the third coding units 1520 c through 1520 e do not satisfy the condition because the boundaries of the third coding units 1520 c through 1520 e that are determined when the second coding unit 1510 b at the right is split into three coding units do not split the width or height of the second coding unit 1510 b at the right into halves. The video decoding apparatus 100 may determine disconnection of a scan order when the condition is not satisfied, and determine that the second coding unit 1510 b at the right is split into the odd number of coding units, based on a result of the determination. According to an embodiment, the video decoding apparatus 100 may set a certain limit on a coding unit at a certain location from among an odd number of coding units obtained by splitting a coding unit, and since such a limit or certain location has been described above through various embodiments, details thereof are not provided again.

FIG. 16 illustrates processes of determining at least one coding unit when the video decoding apparatus 100 splits a first coding unit 1600, according to an embodiment. According to an embodiment, the video decoding apparatus 100 may split the first coding unit 1600 based on at least one of block shape information and split shape information obtained through the obtainer 105). The first coding unit 1600 having a square shape may be split into four coding units having a square shape or a plurality of coding units having a non-square shape. For example, referring to FIG. 16, when block shape information indicates that the first coding unit 1600 is a square and split shape information indicates a split into non-square coding units, the video decoding apparatus 100 may split the first coding unit 1600 into a plurality of non-square coding units. In detail, when split shape information indicates that an odd number of coding units are determined by splitting the first coding unit 1600 in a horizontal direction or a vertical direction, the video decoding apparatus 100 may determine, as the odd number of coding units, second coding units 1610 a through 1610 c by splitting the first coding unit 1600 having a square shape in a vertical direction, or second coding units 1620 a through 1620 c by splitting the first coding unit 1600 in a horizontal direction.

According to an embodiment, the video decoding apparatus 100 may determine whether the second coding units 1610 a through 1610 c and 1620 a through 1620 c included in the first coding unit 1600 satisfy a condition of being processable in a certain order, wherein the condition is related to whether at least one of a width and a height of the first coding unit 1600 is split into halves according to boundaries of the second coding units 1610 a through 1610 c and 1620 a through 1620 c. Referring to FIG. 16, since the boundaries of the second coding units 1610 a through 1610 c determined when the first coding unit 1600 having a square shape is split in a vertical direction do not split the width of the first coding unit 1600 into halves, it may be determined that the first coding unit 1600 does not satisfy the condition of being processable in a certain order. Also, since the boundaries of the second coding units 1620 a through 1620 c determined when the first coding unit 1600 having a square shape is split in a horizontal direction do not split the height of the first coding unit 1600 into halves, it may be determined that the first coding unit 1600 does not satisfy the condition of being processable in a certain order. The video decoding apparatus 100 may determine disconnection of a scan order when the condition is not satisfied, and determine that the first coding unit 1600 is split into the odd number of coding units based on a result of the determination. According to an embodiment, the video decoding apparatus 100 may set a certain limit on a coding unit at a certain location from among an odd number of coding units obtained by splitting a coding unit, and since such a limit or certain location has been described above through various embodiments, details thereof are not provided again.

According to an embodiment, the video decoding apparatus 100 may determine coding units having various shapes by splitting a first coding unit.

Referring to FIG. 16, the video decoding apparatus 100 may split the first coding unit 1600 having a square shape and a first coding unit 1630 or 1650 having a non-square shape into coding units having various shapes.

FIG. 17 illustrates that a shape into which a second coding unit is splittable by the video decoding apparatus 100 is restricted when the second coding unit having a non-square shape determined when a first coding unit 1700 is split satisfies a certain condition, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine that the first coding unit 1700 having a square shape is split into second coding units 1710 a and 1710 b or 1720 a and 1720 b having a non-square shape, based on at least one of block shape information and split shape information obtained through the obtainer 105. The second coding units 1710 a and 1710 b or 1720 a and 1720 b may be independently split. Accordingly, the video decoding apparatus 100 may determine that the second coding units 1710 a and 1710 b or 1720 a and 1720 b are split into a plurality of coding units or are not split based on at least one of block shape information and split shape information related to each of the coding units 1710 a and 1710 b or 1720 a and 1720 b. According to an embodiment, the video decoding apparatus 100 may determine third coding units 1712 a and 1712 b by splitting, in a horizontal direction, the second coding unit 1710 a at the left having a non-square shape, which is determined when the first coding unit 1700 is split in a vertical direction. However, when the second coding unit 1710 a at the left is split in the horizontal direction, the video decoding apparatus 100 may set a limit that the second coding unit 1710 b at the right is not split in the horizontal direction like the second coding unit 1710 a at the left. When third coding units 1714 a and 1714 b are determined when the second coding unit 1710 b at the right is split in the same direction, i.e., the horizontal direction, the third coding units 1712 a, 1712 b, 1714 a, and 1714 b are determined when the second coding units 1710 a at the left and the second coding unit 1710 b at the right are each independently split in the horizontal direction. However, this is the same result as splitting the first coding unit 1700 into four second coding units 1730 a through 1730 d having a square shape based on at least one of block shape information and split shape information, and thus may be inefficient in terms of image decoding.

According to an embodiment, the video decoding apparatus 100 may determine third coding units 1722 a and 1722 b or 1724 a, and 1724 b by splitting, in a vertical direction, the second coding unit 1720 a or 1720 b having a non-square shape determined when the first coding unit 1700 is split in the horizontal direction. However, when one of second coding units (for example, the second coding unit 1720 a at the top) is split in a vertical direction, the video decoding apparatus 100 may set a limit that the other second coding unit (for example, the second coding unit 1720 b at the bottom) is not split in the vertical direction like the second coding unit 1720 a at the top for the above described reasons.

FIG. 18 illustrates processes of the video decoding apparatus 100 splitting a coding unit having a square shape when split shape information is unable to indicate that a coding unit is split into four square shapes, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine second coding units 1810 a and 1810 b, or 1820 a and 1820 b, by splitting a first coding unit 1800 based on at least one of block shape information and split shape information. Split shape information may include information about various shapes into which a coding unit may be split, but such information about various shapes may not include information for splitting a coding unit into four square coding units. According to such split shape information, the video decoding apparatus 100 is unable to split the first coding unit 1800 having a square shape into four second coding units 1830 through 1830 d having a square shape. The video decoding apparatus 100 may determine the second coding units 1810 a and 1810 b, or 1820 a and 1820 b having a non-square shape based on the split shape information.

According to an embodiment, the video decoding apparatus 100 may independently split each of the second coding units 1810 a and 1810 b, or 1820 a and 1820 b having a non-square shape. Each of the second coding units 1810 a and 1810 b, or 1820 a and 1820 b may be split in a certain order via a recursive method that may be a split method corresponding to a method of splitting the first coding unit 1800 based on at least one of the block shape information and the split shape information.

For example, the video decoding apparatus 100 may determine third coding units 1812 a and 1812 b having a square shape by splitting the second coding unit 1810 a at the left in a horizontal direction, or determine third coding units 1814 a and 1814 b having a square shape by splitting the second coding unit 1810 b at the right in a horizontal direction. In addition, the video decoding apparatus 100 may determine third coding units 1816 a through 1816 d having a square shape by splitting both the second coding unit 1810 a at the left and the second coding unit 1810 b at the right in the horizontal direction. In this case, coding units may be determined in the same manner as when the first coding unit 1800 is split into four second coding units 1830 a through 1830 d having a square shape.

As another example, the video decoding apparatus 100 may determine third coding units 1822 a and 1822 b having a square shape by splitting the second coding unit 1820 a at the top in a vertical direction, and determine third coding units 1824 a and 1824 b having a square shape by splitting the second coding unit 1820 b at the bottom in a vertical direction. In addition, the video decoding apparatus 100 may determine third coding units 1826 a through 1826 d having a square shape by splitting both the second coding unit 1820 a at the top and the second coding unit 1820 b at the bottom in the vertical direction. In this case, coding units may be determined in the same manner as when the first coding unit 1800 is split into four second coding units 1830 a through 1830 d having a square shape.

FIG. 19 illustrates that an order of processing a plurality of coding units may be changed according to processes of splitting a coding unit, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may split a first coding unit 1900 based on block shape information and split shape information. When the block shape information indicates a square shape and the split shape information indicates that the first coding unit 1900 is split in at least one of a horizontal direction and a vertical direction, the video decoding apparatus 100 may split the first coding unit 1900 to determine second coding units 1910 a and 1910 b, or 1920 a and 1920 b. Referring to FIG. 19, the second coding units 1910 a and 1910 b, or 1920 a and 1920 b having a non-square shape and determined when the first coding unit 1900 is split in the horizontal direction or the vertical direction may each be independently split based on block shape information and split shape information. For example, the video decoding apparatus 100 may determine third coding units 1916 a through 1916 d by splitting, in the horizontal direction, each of the second coding units 1910 a and 1910 b generated as the first coding unit 1900 is split in the vertical direction, or determine third coding units 1926 a through 1926 d by splitting, in the horizontal direction, the second coding units 1920 a and 1920 b generated as the first coding unit 1900 is split in the horizontal direction. Processes of splitting the second coding units 1910 a and 1910 b, or 1920 a and 1920 b have been described above with reference to FIG. 17, and thus details thereof are not provided again.

According to an embodiment, the video decoding apparatus 100 may process coding units according to a certain order. Features about processing coding units according to a certain order have been described above with reference to FIG. 14, and thus details thereof are not provided again. Referring to FIG. 19, the video decoding apparatus 100 may determine four third coding units 1916 a through 1916 d or 1926 a through 1926 d having a square shape by splitting the first coding unit 1900 having a square shape. According to an embodiment, the video decoding apparatus 100 may determine an order of processing the third coding units 1916 a through 1916 d or 1926 a through 1926 d based on how the first coding unit 1900 is split.

According to an embodiment, the video decoding apparatus 100 may determine the third coding units 1916 a through 1916 d by splitting, in the horizontal direction, the second coding units 1910 a and 1910 b generated as the first coding unit 1900 is split in the vertical direction, and process the third coding units 1916 a through 1916 d according to an order 1917 of first processing, in the vertical direction, the third coding units 1916 a and 1916 b included in the second coding unit 1910 a at the left, and then processing, in the vertical direction, the third coding units 1916 c and 1916 d included in the second coding unit 1910 b at the right.

According to an embodiment, the video decoding apparatus 100 may determine the third coding units 1926 a through 1926 d by splitting, in the vertical direction, the second coding units 1920 a and 1920 b generated as the first coding unit 1900 is split in the horizontal direction, and process the third coding units 1926 a through 1926 d according to an order 1927 of first processing, in the horizontal direction, the third coding units 1926 a and 1926 b included in the second coding unit 1920 a at the top, and then processing, in the horizontal direction, the third coding units 1926 c and 1926 d included in the second coding unit 1920 b at the bottom.

Referring to FIG. 19, the third coding units 1916 a through 1916 d or 1926 a through 1926 d having a square shape may be determined when the second coding units 1910 a and 1910 b, or 1920 a and 1920 b are each split. The second coding units 1910 a and 1910 b determined when the first coding unit 1900 is split in the vertical direction and the second coding units 1920 a and 1920 b determined when the first coding unit 1900 is split in the horizontal direction are split in different shapes, but according to the third coding units 1916 a through 1916 d and 1926 a through 1926 d determined afterwards, the first coding unit 1900 is split in coding units having same shapes. Accordingly, the video decoding apparatus 100 may process pluralities of coding units determined in same shapes in different orders even when the coding units having the same shapes are consequently determined when coding units are recursively split through different processes based on at least one of block shape information and split shape information.

FIG. 20 illustrates processes of determining a depth of a coding unit as a shape and size of the coding unit are changed, when a plurality of coding units are determined when the coding unit is recursively split, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine a depth of a coding unit according to a certain standard. For example, the certain standard may be a length of a long side of the coding unit. When a length of a long side of a current coding unit is split 2 n times shorter than a length of a long side of a coding unit before being split, it may be determined that a depth of the current coding unit is increased n times a depth of the coding unit before being split, wherein n>0. Hereinafter, a coding unit having an increased depth is referred to as a coding unit of a lower depth.

Referring to FIG. 20, the video decoding apparatus 100 may determine a second coding unit 2002 and a third coding unit 2004 of lower depths by splitting a first coding unit 2000 having a square shape, based on block shape information indicating a square shape (for example, block shape information may indicate ‘0:SQURE’), according to an embodiment. When a size of the first coding unit 2000 having a square shape is 2N×2N, the second coding unit 2002 determined by splitting a width and a height of the first coding unit 2000 by ½{circumflex over ( )}1 may have a size of N×N. In addition, the third coding unit 2004 determined by splitting a width and a height of the second coding unit 2002 by ½ may have a size of N/2× N/2. In this case, a width and a height of the third coding unit 2004 corresponds to ½{circumflex over ( )}2 of the first coding unit 2000. When a depth of first coding unit 2000 is D, a depth of the second coding unit 2002 having ½{circumflex over ( )}1 of the width and the height of the first coding unit 2000 may be D+1, and a depth of the third coding unit 2004 having ½{circumflex over ( )}2 of the width and the height of the first coding unit 2000 may be D+2.

According to an embodiment, the video decoding apparatus 100 may determine a second coding unit 2012 or 2022 and a third coding unit 2014 or 2024 by splitting a first coding unit 2010 or 2020 having a non-square shape, based on block shape information indicating a non-square shape (for example, block shape information may indicate ‘1:NS_VER’ indicating a non-square shape in which a height is longer than a width, or ‘2:NS_HOR’ indicating a non-square shape in which a width is longer than a height), according to an embodiment.

The video decoding apparatus 100 may determine a second coding unit (for example, the second coding unit 2002, 2012, or 2022) by splitting at least one of a width and a height of the first coding unit 2010 having a size of N×2N. In other words, the video decoding apparatus 100 may determine the second coding unit 2002 having a size of N×N or the second coding unit 2022 having a size of N×N/2 by splitting the first coding unit 2010 in a horizontal direction, or determine the second coding unit 2012 having a size of N/2×N by splitting the first coding unit 2010 in horizontal and vertical directions.

The video decoding apparatus 100 may determine a second coding unit (for example, the second coding unit 2002, 2012, or 2022) by splitting at least one of a width and a height of the first coding unit 2020 having a size of 2N×N. In other words, the video decoding apparatus 100 may determine the second coding unit 2002 having a size of N×N or the second coding unit 2012 having a size of N/2×N by splitting the first coding unit 2020 in a vertical direction, or determine the second coding unit 2022 having a size of N×N/2 by splitting the first coding unit 2010 in horizontal and vertical directions.

According to an embodiment, the video decoding apparatus 100 may determine a third coding unit (for example, the third coding unit 2004, 2014, or 2024) by splitting at least one of a width and a height of the second coding unit 2002 having a size of N×N. In other words, the video decoding apparatus 100 may determine the third coding unit 2004 having a size of N/2×N/2, the third coding unit 2014 having a size of N/22×N/2, or the third coding unit 2024 having a size of N/2× N/22 by splitting the second coding unit 2002 in vertical and horizontal directions.

According to an embodiment, the video decoding apparatus 100 may determine a third coding unit (for example, the third coding unit 2004, 2014, or 2024) by splitting at least one of a width and a height of the second coding unit 2022 having a size of N/2×N. In other words, the video decoding apparatus 100 may determine the third coding unit 2004 having a size of N/2×N/2 or the third coding unit 2024 having a size of N/2×N/22 by splitting the second coding unit 2012 in a horizontal direction, or the third coding unit 2014 having a size of N/22× N/2 by splitting the second coding unit 2012 in vertical and horizontal directions.

According to an embodiment, the video decoding apparatus 100 may determine a third coding unit (for example, the third coding unit 2004, 2014, or 2024) by splitting at least one of a width and a height of the second coding unit 2022 having a size of N×N/2. In other words, the video decoding apparatus 100 may determine the third coding unit 2004 having a size of N/2×N/2 or the third coding unit 2014 having a size of N/22× N/2 by splitting the second coding unit 2022 in a vertical direction, or the third coding unit 2024 having a size of N/2×N/22 by splitting the second coding unit 2022 in vertical and horizontal directions.

According to an embodiment, the video decoding apparatus 100 may split a coding unit (for example, the first, second, or third coding unit 2000, 2002, or 2004) having a square shape in a horizontal or vertical direction. For example, the first coding unit 2010 having a size of N×2N may be determined by splitting the first coding unit 2000 having a size of 2N×2N in the vertical direction, or the first coding unit 2020 having a size of 2N×N may be determined by splitting the first coding unit 2000 in the horizontal direction. According to an embodiment, when a depth is determined based on a length of a longest side of a coding unit, a depth of a coding unit determined when the first coding unit 2000 having a size of 2N×2N is split in a horizontal or vertical direction may be the same as a depth of the first coding unit 2000.

According to an embodiment, the width and the height of the third coding unit 2014 or 2024 may be ½{circumflex over ( )}2 of those of the first coding unit 2010 or 2020. When the depth of the first coding unit 2010 or 2020 is D, the depth of the second coding unit 2012 or 2022 that is ½ of the width and the height of the first coding unit 2010 or 2020 may be D+1, and the depth of the third coding unit 2014 or 2024 that is ½{circumflex over ( )}2 of the width and the height of the first coding unit 2010 or 202 may be D+2.

FIG. 21 illustrates a part index (PID) for distinguishing depths and coding units, which may be determined according to shapes and sizes of coding units, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine a second coding unit having various shapes by splitting a first coding unit 2100 having a square shape. Referring to FIG. 21, the video decoding apparatus 100 may determine second coding units 2102 a and 2102 b, 2104 a and 2104 b, or 2106 a through 2106 d by splitting the first coding unit 2100 in at least one of a vertical direction and a horizontal direction, according to split shape information. In other words, the video decoding apparatus 100 may determine the second coding units 2102 a and 2102 b, 2104 a and 2104 b, or 2106 a through 2106 d based on split shape information of the first coding unit 2100.

According to an embodiment, a depth of the second coding units 2102 a and 2102 b, 2104 a and 2104 b, or 2106 a through 2106 d determined according to the split shape information of the first coding unit 2100 having a square shape may be determined based on a length of a long side. For example, since a length of one side of the first coding unit 2100 having a square shape is the same as a length of a long side of the second coding units 2102 a and 2102 b or 2104 a and 2104 b having a non-square shape, the depths of the first coding unit 2100 and the second coding units 2102 a and 2102 b or 2104 a and 2104 b having a non-square shape may be the same, i.e., D. On the other hand, when the video decoding apparatus 100 splits the first coding unit 2100 into the four second coding units 2106 a through 2106 d having a square shape, based on the split shape information, a length of one side of the second coding units 2106 a through 2106 d having a square shape is ½ of the length of one side of the first coding unit 2100, the depths of the second coding units 2106 a through 2106 d may be D+1, i.e., a depth lower than the depth D of the first coding unit 2100.

According to an embodiment, the video decoding apparatus 100 may split a first coding unit 2110, in which a height is longer than a width, in a horizontal direction into a plurality of second coding units 2112 a and 2112 b or 2114 a through 2114 c, according to split shape information. According to an embodiment, the video decoding apparatus 100 may split a first coding unit 2120, in which a width is longer than a height, in a vertical direction into a plurality of second coding units 2122 a and 2122 b or 2124 a through 2124 c, according to split shape information.

According to an embodiment, depths of the second coding units 2112 a and 2112 b, 2114 a through 2114 c, 2122 a and 2122 b, or 2124 a through 2124 c determined according to the split shape information of the first coding unit 2110 or 2120 having a non-square shape may be determined based on a length of a long side. For example, since a length of one side of the second coding units 2112 a and 2112 b having a square shape is ½ of a length of a long side of the first coding unit 2110 having a non-square shape, in which the height is longer than the width, the depths of the second coding units 2112 a and 2112 b are D+1, i.e., depths lower than the depth D of the first coding unit 2110 having a non-square shape.

In addition, the video decoding apparatus 100 may split the first coding unit 2110 having a non-square shape into an odd number of second coding units 2114 a through 2114 c, based on split shape information. The odd number of second coding units 2114 a through 2114 c may include the second coding units 2114 a and 2114 c having a non-square shape, and the second coding unit 2114 b having a square shape. In this case, since a length of a long side of the second coding units 2114 a and 2114 c having a non-square shape and a length of one side of the second coding unit 2114 b having a square shape are ½ of a length of one side of the first coding unit 2110, depths of the second coding units 2114 a through 2114 b may be D+1, i.e., a depth lower than the depth D of the first coding unit 2110. The video decoding apparatus 100 may determine depths of coding units related to the first coding unit 2120 having a non-square shape in which a width is longer than a height, in the same manner as the determining of depths of coding units related to the first coding unit 2110.

According to an embodiment, with respect to determining PIDs for distinguishing coding units, when an odd number of coding units do not have the same size, the video decoding apparatus 100 may determine PIDs based on a size ratio of the coding units (Referring to FIG. 21, the second coding unit 2114 b located at the center from the odd number of second coding units 2114 a through 2114 c may have the same width as the second coding units 2114 a and 2114 c, but have a height twice higher than those of the second coding units 2114 a and 2114 c. In this case, the second coding unit 2114 b located at the center may include two of the second coding units 2114 a and 2114 c. Accordingly, when the PID of the second coding unit 2114 b located at the center is 1 according to a scan order, the PID of the second coding unit 2114 c in a next order may be 3, the PID having increased by 2. In other words, values of the PID may be discontinuous. According to an embodiment, the video decoding apparatus 100 may determine whether an odd number of coding units have the same sizes based on discontinuity of PID for distinguishing the coding units.

According to an embodiment, the video decoding apparatus 100 may determine whether a plurality of coding units determined when a current coding unit is split have certain split shapes based on values of PID. Referring to FIG. 21, the video decoding apparatus 100 may determine the even number of second coding units 2112 a and 211 b or the odd number of second coding units 2114 a through 2114 c by splitting the first coding unit 2110 having a rectangular shape in which the height is longer than the width. The video decoding apparatus 100 may use the PID indicating each coding unit so as to distinguish a plurality of coding units. According to an embodiment, a PID may be obtained from a sample at a certain location (for example, an upper left sample) of each coding unit.

According to an embodiment, the video decoding apparatus 100 may determine a coding unit at a certain location from among coding units determined by using PIDs for distinguishing coding units. According to an embodiment, when split shape information of the first coding unit 2110 having a rectangular shape in which a height is longer than a width indicates that the first coding unit 2110 is split into three coding units, the video decoding apparatus 100 may split the first coding unit 2110 into the three second coding units 2114 a through 2114 c. The video decoding apparatus 100 may assign a PID to each of the three second coding units 2114 a through 2114 c. The video decoding apparatus 100 may compare PIDs of an odd number of coding units so as to determine a center coding unit from among the coding units. The video decoding apparatus 100 may determine, as a coding unit at a center location from among coding units determined when the first coding unit 2110 is split, the second coding unit 2114 b having a PID corresponding to a center value from among PIDs, based on PIDs of the coding units. According to an embodiment, while determining PIDs for distinguishing coding units, when the coding units do not have the same sizes, the video decoding apparatus 100 may determine PIDs based on a size ratio of the coding units. Referring to FIG. 21, the second coding unit 2114 b generated when the first coding unit 2110 is split may have the same width as the second coding units 2114 a and 2114 c, but may have a height twice higher than those of the second coding units 2114 a and 2114 c. In this case, when the PID of the second coding unit 2114 b located at the center is 1, the PID of the second coding unit 2114 c in a next order may be 3, the PID having increased by 2. As such, when an increasing range of PIDs differs while uniformly increasing, the video decoding apparatus 100 may determine that a current coding unit is split into a plurality of coding units including a coding unit having a different size from other coding units. According to an embodiment, when split shape information indicates splitting into an odd number of coding units, the video decoding apparatus 100 may split a current coding unit into a plurality of coding units, in which a coding unit at a certain location (for example, a center coding unit) has a size different from other coding units. In this case, the video decoding apparatus 100 may determine the center coding unit having the different size by using PIDs of the coding units. However, a PID, and a size or location of a coding unit at a certain location described above are specified to describe an embodiment, and thus should not be limitedly interpreted, and various PIDs, and various locations and sizes of a coding unit may be used.

According to an embodiment, the video decoding apparatus 100 may use a certain data unit from which recursive splitting of a coding unit is started.

FIG. 22 illustrates that a plurality of coding units are determined according to a plurality of certain data units included in a picture, according to an embodiment.

According to an embodiment, a certain data unit may be defined as a data unit from which a coding unit starts to be recursively split by using at least one of block shape information and split shape information. In other words, the certain data unit may correspond to a coding unit of an uppermost depth used while determining a plurality of coding units by splitting a current picture. Hereinafter, the certain data unit is referred to as a reference data unit for convenience of description.

According to an embodiment, the reference data unit may indicate a certain size and shape. According to an embodiment, the reference data unit may include M×N samples. Here, M and N may be the same, and may be an integer expressed as a multiple of 2. In other words, a reference data unit may indicate a square shape or a non-square shape, and may later be split into an integer number of coding units.

According to an embodiment, the video decoding apparatus 100 may split a current picture into a plurality of reference data units. According to an embodiment, the video decoding apparatus 100 may split the plurality of reference data units obtained by splitting the current picture by using split shape information about each of the reference data units. Split processes of such reference data units may correspond to split processes using a quad-tree structure.

According to an embodiment, the video decoding apparatus 100 may pre-determine a smallest size available for the reference data unit included in the current picture. Accordingly, the video decoding apparatus 100 may determine the reference data unit having various sizes that are equal to or larger than the smallest size, and determine at least one coding unit based on the determined reference data unit by using block shape information and split shape information.

Referring to FIG. 22, the video decoding apparatus 100 may use a reference coding unit 2200 having a square shape, or may use a reference coding unit 2202 having a non-square shape. According to an embodiment, a shape and size of a reference coding unit may be determined according to various data units (for example, a sequence, a picture, a slice, a slice segment, and a largest coding unit) that may include at least one reference coding unit.

According to an embodiment, the obtainer 105 of the video decoding apparatus 100 may obtain, from a bitstream, at least one of information about a shape of a reference coding unit and information about a size of the reference coding unit, according to the various data units. Processes of determining at least one coding unit included in the reference coding unit 2200 having a square shape have been described above through processes of splitting the current coding unit 1000 of FIG. 10, and processes of determining at least one coding unit included in the reference coding unit 2200 having a non-square shape have been described above through processes of splitting the current coding unit 1100 or 1150 of FIG. 11, and thus details thereof are not provided again.

According to an embodiment, in order to determine a size and shape of a reference coding unit according to some data units pre-determined based on a predetermined condition, the video decoding apparatus 100 may use a PID for distinguishing the size and shape of the reference coding unit. In other words, the obtainer 105 may obtain, from a bitstream, only a PID for distinguishing a size and shape of a reference coding unit as a data unit satisfying a predetermined condition (for example, a data unit having a size equal to or smaller than a slice) from among various data units (for example, a sequence, a picture, a slice, a slice segment, and a largest coding unit), according to slices, slice segments, and largest coding units. The video decoding apparatus 100 may determine the size and shape of the reference data unit according to data units that satisfy the predetermined condition, by using the PID. When information about a shape of a reference coding unit and information about a size of a reference coding unit are obtained from a bitstream and used according to data units having relatively small sizes, usage efficiency of the bitstream may not be sufficient, and thus instead of directly obtaining the information about the shape of the reference coding unit and the information about the size of the reference coding unit, only a PID may be obtained and used. In this case, at least one of the size and the shape of the reference coding unit corresponding to the PID indicating the size and shape of the reference coding unit may be pre-determined. In other words, the video decoding apparatus 100 may select at least one of the pre-determined size and shape of the reference coding unit according to the PID so as to determine at least one of the size and shape of the reference coding unit included in a data unit that is a criterion for obtaining the PID.

According to an embodiment, the video decoding apparatus 100 may use at least one reference coding unit included in one largest coding unit. In other words, a largest coding unit splitting an image may include at least one reference coding unit, and a coding unit may be determined when each of the reference coding unit is recursively split. According to an embodiment, at least one of a width and height of the largest coding unit may be an integer times at least one of a width and height of the reference coding unit. According to an embodiment, a size of a reference coding unit may be equal to a size of a largest coding unit, which is split n times according to a quad-tree structure. In other words, the video decoding apparatus 100 may determine a reference coding unit by splitting a largest coding unit n times according to a quad-tree structure, and split the reference coding unit based on at least one of block shape information and split shape information according to various embodiments.

FIG. 23 illustrates a processing block serving as a criterion of determining a determination order of reference coding units included in a picture 2300, according to an embodiment.

According to an embodiment, the video decoding apparatus 100 may determine at least one processing block splitting a picture. A processing block is a data unit including at least one reference coding unit splitting an image, and the at least one reference coding unit included in the processing block may be determined in a certain order. In other words, a determining order of the at least one reference coding unit determined in each processing block may correspond to one of various orders for determining a reference coding unit, and may vary according to processing blocks. A determining order of reference coding units determined per processing block may be one of various orders, such as a raster scan order, a Z-scan order, an N-scan order, an up-right diagonal scan order, a horizontal scan order, and a vertical scan order, but should not be limitedly interpreted with respect to the scan orders.

According to an embodiment, the video decoding apparatus 100 may determine a size of at least one processing block included in an image by obtaining information about a size of a processing block. The video decoding apparatus 100 may obtain, from a bitstream, the information about a size of a processing block to determine the size of the at least one processing block included in the image. The size of the processing block may be a certain size of a data unit indicated by the information about a size of a processing block.

According to an embodiment, the obtainer 105 of the video decoding apparatus 100 may obtain, from the bitstream, the information about a size of a processing block according to certain data units. For example, the information about a size of a processing block may be obtained from the bitstream in data units of images, sequences, pictures, slices, and slice segments. In other words, the obtainer 105 may obtain, from the bitstream, the information about a size of a processing block according to such several data units, and the video decoding apparatus 100 may determine the size of at least one processing block splitting the picture by using the obtained information about a size of a processing block, wherein the size of the processing block may be an integer times a size of a reference coding unit.

According to an embodiment, the video decoding apparatus 100 may determine sizes of processing blocks 2302 and 2312 included in the picture 2300. For example, the video decoding apparatus 100 may determine a size of a processing block based on information about a size of a processing block, the information being obtained from a bitstream. Referring to FIG. 23, the video decoding apparatus 100 may determine horizontal sizes of the processing blocks 2302 and 2312 to be four times a horizontal size of a reference coding unit, and a vertical size thereof to be four times a vertical size of the reference coding unit, according to an embodiment. The video decoding apparatus 100 may determine a determining order of at least one reference coding unit in at least one processing block.

According to an embodiment, the video decoding apparatus 100 may determine each of the processing blocks 2302 and 2312 included in the picture 2300 based on a size of a processing block, and determine a determining order of at least one reference coding unit included in each of the processing blocks 2302 and 2312. According to an embodiment, determining of a reference coding unit may include determining a size of the reference coding unit.

According to an embodiment, the video decoding apparatus 100 may obtain, from a bitstream, information about a determining order of at least one reference coding unit included in at least one processing block, and determine the determining order of the at least one reference coding unit based on the obtained information. The information about a determining order may be defined as an order or direction of determining reference coding units in a processing block. In other words, an order of determining reference coding units may be independently determined per processing block.

According to an embodiment, the video decoding apparatus 100 may obtain, from a bitstream, information about a determining order of a reference coding unit according to certain data units. For example, the obtainer 105 may obtain, from the bitstream, the information about a determining order of a reference coding unit according to data units, such as images, sequences, pictures, slices, slice segments, and processing blocks. Since the information about a determining order of a reference coding unit indicates a determining order of a reference coding unit in a processing block, the information about a determining order may be obtained per certain data unit including an integer number of processing blocks.

According to an embodiment, the video decoding apparatus 100 may determine at least one reference coding unit based on the determined order.

According to an embodiment, the obtainer 105 may obtain, from the bitstream, information about a determining order of a reference coding unit, as information related to the processing blocks 2302 and 2312, and the video decoding apparatus 100 may determine an order of determining at least one reference coding unit included in the processing blocks 2302 and 2312 and determine at least one reference coding unit included in the picture 2300 according to a determining order of a coding unit. Referring to FIG. 23, the video decoding apparatus 100 may determine determining orders 2304 and 2314 of at least one reference coding unit respectively related to the processing blocks 2302 and 2312. For example, when information about a determining order of a reference coding unit is obtained per processing block, determining orders of a reference coding unit related to the processing blocks 2302 and 2312 may be different from each other. When the determining order 2304 related to the processing block 2302 is a raster scan order, reference coding units included in the processing block 2302 may be determined according to the raster scan order. On the other hand, when the determining order 2314 related to the processing block 2312 is an inverse order of a raster scan order, reference coding units included in the processing block 2312 may be determined in the inverse order of the raster scan order.

The video decoding apparatus 100 may decode determined at least one reference coding unit, according to an embodiment. The video decoding apparatus 100 may decode an image based on reference coding units determined through above embodiments. Examples of a method of decoding a reference coding unit may include various methods of decoding an image.

According to an embodiment, the video decoding apparatus 100 may obtain, from a bitstream, and use block shape information indicating a shape of a current coding unit or split shape information indicating a method of splitting the current coding unit. The block shape information or the split shape information may be included in a bitstream related to various data units. For example, the video decoding apparatus 100 may use the block shape information or split shape information, which is included in a sequence parameter set, a picture parameter set, a video parameter set, a slice header, and a slice segment header. In addition, the video decoding apparatus 100 may obtain, from a bitstream, and use syntax corresponding to the block shape information or the split shape information, according to largest coding units, reference coding units, and processing blocks.

While this disclosure has been particularly shown and described with reference to embodiments thereof, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the disclosure as defined by the appended claims. The embodiments should be considered in a descriptive sense only and not for purposes of limitation. Therefore, the scope of the disclosure is defined not by the detailed description of the disclosure but by the appended claims, and all differences within the scope will be construed as being included in the present disclosure.

The embodiments of the present disclosure can be written as computer programs and can be implemented in general-use digital computers that execute the programs using a computer readable recording medium. Examples of the computer readable recording medium include magnetic storage media (e.g., ROM, floppy disks, hard disks, etc.), optical recording media (e.g., CD-ROMs, or DVDs), etc. 

The invention claimed is:
 1. A video decoding method comprising: obtaining, from a bitstream, motion prediction mode information regarding a current block in a current picture; when the obtained motion prediction mode information indicates a bi-directional motion prediction mode, obtaining, from the bitstream, a first motion vector indicating a first reference block of the current block in a first reference picture and a second motion vector indicating a second reference block of the current block in a second reference picture; generating a gradient value of a first pixel in vertical direction from among pixels of the first reference block indicated by the first motion vector by applying a first one-dimensional gradient filter to a first neighboring region of the first pixel, generating a gradient value of the first pixel in horizontal direction by applying a second one-dimensional gradient filter to a second neighboring region of the first pixel, and generating a gradient value of a second pixel in vertical direction from among pixels of the second reference block indicated by the second motion vector by applying a third one-dimensional gradient filter to a first neighboring region of the second pixel, and generating a gradient value of the second pixel in horizontal direction by applying a fourth one-dimensional gradient filter to a second neighboring region of the second pixel; determining displacement vectors in a horizontal direction and a vertical direction; and generating a prediction pixel value of a current pixel in the current block by using a first value and a second value, wherein the current pixel corresponds to the first pixel and the second pixel, the first value is generated by using a pixel value of the first pixel and a pixel value of the second pixel, the second value is generated by using the gradient values of the first pixel in vertical direction and in horizontal direction, the gradient values of the second pixel in vertical direction and in horizontal direction, and the displacement vectors in the horizontal direction and the vertical direction, wherein when applying a one-dimensional gradient filter to a neighboring region, a weighted sum of pixel values of pixels included in the neighboring region is determined, wherein weights for the weighted sum correspond to filter coefficients of the one-dimensional gradient filter, wherein when applying a one-dimensional gradient filter to generate a gradient value of one of the first pixel and the second pixel in one of vertical direction and horizontal direction, de-scaling is performed based on a de-scaling bit number on a value generated after the one-dimensional gradient filter is applied to at least one pixel value included in the neighboring region and is not performed on at least one coefficient of a one-dimensional gradient filter and is not performed on the at least one pixel value included in the neighboring region, wherein the de-scaling comprises bit-shifting to right by the de-scaling bit number, wherein the displacement vectors are clipped based on a threshold value when an intermediate value used for determining the displacement vectors is greater than a predetermined value, and wherein the displacement vectors are 0 when the intermediate value used for determining the displacement vectors is smaller than or equal to the predetermined value.
 2. The video decoding method of claim 1, wherein the determining the displacement vectors in the horizontal direction and the vertical direction comprises: determining the displacement vectors in the horizontal direction and the vertical direction by using gradient values of pixels in a first window having a certain size and comprising the first pixel, gradient values of pixels in a second window having a certain size and comprising the second pixel, pixel values of the pixels in the first window, and pixel values of the pixels in the second window.
 3. The video decoding method of claim 1, wherein the first motion vector is a vector indicating the first pixel at a fractional pixel position (i+α, j+β), wherein i and j are each an integer and α and β are each a fraction, and the generating of the gradient value of the first pixel comprises: generating a gradient value at a pixel position (i, j+β) by applying a one-dimensional gradient filter to a pixel value at a pixel position (i, j) and pixel values of integer pixels positioned in a vertical direction from a pixel at the pixel position (i, j) included in the first neighboring region of the first pixel; and generating the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by applying an one-dimensional interpolation filter to the gradient value at the pixel position (i, j+β) and gradient values of pixels, in which a position of a horizontal component is an integer pixel position, from among pixels positioned in the horizontal direction from the pixel position (i, j+β) included in the first neighboring region of the first pixel.
 4. The video decoding method of claim 3, wherein the generating of the gradient value at a pixel position (i, j+β) comprises generating the gradient value at the pixel position (i, j+β) by applying an M-tap gradient filter with respect to the pixel at the pixel position (i, j) and M−1 neighboring integer pixels positioned in the vertical direction from the pixel at the pixel position (i, j) included in the first neighboring region of the first pixel, wherein M is an integer, and the generating of the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) comprises generating the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by applying an N-tap interpolation filter with respect to the gradient value at the pixel position (i, j+β) and gradient values of N−1 pixels, in which a position of a horizontal component is an integer pixel position, from among pixels positioned in the horizontal direction from the pixel position (i, j+β) included in the first neighboring region of the first pixel, wherein N is an integer.
 5. The video decoding method of claim 4, wherein the N-tap interpolation filter is a discrete cosine transform-based interpolation filter for a pixel value at a fractional pixel position in a horizontal direction, and N is
 6. 6. The video decoding method of claim 5, wherein the generating of the gradient value at the pixel position (i, j+β) by applying the M-tap gradient filter comprises generating the gradient value at the pixel position (i, j+β) by performing de-scaling on a value to which the M-tap gradient filter is applied, based on the de-scaling bit number, and wherein the de-scaling bit number is based on a bit depth of a sample.
 7. The video decoding method of claim 5, wherein, when a filter coefficient of the M-tap gradient filter is scaled by 2{circumflex over ( )}x and a filter coefficient of the N-tap interpolation filter is scaled by 2{circumflex over ( )}y, wherein x and y are each an integer, the generating of the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by applying the N-tap interpolation filter comprises generating the gradient value of the first pixel in the vertical direction at the fractional pixel position (i+α, j+β) by performing de-scaling on a value to which the N-tap interpolation filter is applied, based on the de-scaling bit number, and the de-scaling bit number is based on the bit depth of the sample, x, and y.
 8. The video decoding method of claim 4, wherein the M-tap gradient filter is an interpolation filter for a gradient value at a fractional pixel position in a vertical direction, in which a filter coefficient is pre-determined by using a discrete cosine transform-based interpolation filter in the vertical direction, and M is
 6. 9. The video decoding method of claim 1, wherein the first motion vector is a vector indicating the first pixel at a fractional pixel position (i+α, j+β), wherein i and j are each an integer and α and β are each a fraction, and the generating of the gradient value of the first pixel comprises: generating a pixel value at a pixel position (i, j+β) by applying an interpolation filter to a pixel value at a pixel position (i, j) and pixel values of integer pixels positioned in a vertical direction from a pixel at the pixel position (i, j) included in the second neighboring region of the first pixel; and generating the gradient value of the first pixel in the horizontal direction at the fractional pixel position (i+α, j+β) by applying a gradient filter to the pixel value at the pixel position (i, j+β) and pixel values of pixels, in which a position of a horizontal component is an integer pixel position, from among pixels positioned in the horizontal direction from the pixel position (i, j+β) included in the second neighboring region of the first pixel.
 10. The video decoding method of claim 9, wherein the generating of the pixel value at the pixel position (i, j+β) comprises generating the pixel value at the pixel position (i, j+β) by applying an N-tap interpolation filter with respect to the pixel value at the pixel position (i, j+β) and pixel values of N−1 neighboring pixels, in which a component in a predetermined direction is an integer, the N−1 neighboring pixels positioned in the vertical direction from the pixel position (i, j+β) included in the second neighboring region of the first pixel, wherein N is an integer, and the generating of the gradient value of the first pixel in the horizontal direction at the fractional pixel position (i+α, j+β) comprises generating the gradient value of the first pixel in the horizontal direction at the fractional pixel position (i+α, j+β) by applying an M-tap gradient filter with respect to the pixel value at the pixel position (i, j+β) and pixel values of M−1 pixels, in which a position of a horizontal component is an integer pixel position, from among the pixels positioned in the horizontal direction from the pixel position (i, j+β) included in the second neighboring region of the first pixel, wherein M is an integer.
 11. A non-transitory computer-readable recording medium having recorded thereon a program which, when executed by a computer, performs the video decoding method of claim
 1. 12. A video encoding method comprising: determining a first reference block of a first reference picture corresponding to a current block in a current picture, and a second reference block of a second reference picture corresponding to the current block, and determining a first motion vector indicating the first reference block and a second motion vector indicating the second reference block; generating a gradient value of a first pixel in vertical direction from among pixels of the first reference block by applying a first one-dimensional gradient filter to a first neighboring region of the first pixel, generating a gradient value of the first pixel in horizontal direction by applying a second one-dimensional gradient filter to a second neighboring region of the first pixel, and generating a gradient value of a second pixel in vertical direction from among pixels of the second reference block by applying a third gradient one-dimensional filter to a first neighboring region of the second pixel and generating a gradient value of the second pixel in horizontal direction by applying a fourth one-dimensional gradient filter to a second neighboring region of the second pixel; determining displacement vectors in a horizontal direction and a vertical direction; generating a prediction pixel value of a current pixel in the current block by using a first value and a second value, wherein the current pixel corresponds to the first pixel and the second pixel, the first value is generated by using a pixel value of the first pixel and a pixel value of the second pixel, the second value is generated by using the gradient values of the first pixel in vertical direction and in horizontal direction, the gradient values of the second pixel in vertical direction and in horizontal direction, and the displacement vectors in the horizontal direction and in the vertical direction, and generating a bitstream comprising information about the first motion vector and the second motion vector and motion prediction mode information indicating that a motion prediction mode of the current block is a bi-directional motion prediction mode, and wherein when applying a one-dimensional gradient filter to a neighboring region, a weighted sum of pixel values of pixels included in the neighboring region is determined, wherein weights for the weighted sum correspond to filter coefficients of the one-dimensional gradient filter, wherein when applying a one-dimensional gradient filter to generate a gradient value of one of the first pixel and the second pixel in one of vertical direction and horizontal direction, de-scaling is performed based on a de-scaling bit number on a value generated after the one-dimensional gradient filter is applied to at least one pixel value included in the neighboring region and is not performed on at least one coefficient of a one-dimensional gradient filter and is not performed on the at least one pixel value included in the neighboring region, wherein the de-scaling comprises bit-shifting to right by the de-scaling bit number, wherein the displacement vectors are clipped based on a threshold value when an intermediate value used for determining the displacement vectors is greater than a predetermined value, and wherein the displacement vectors are 0 when the intermediate value used for determining the displacement vectors is smaller than or equal to the predetermined value.
 13. A video decoding apparatus comprising: at least one processor configured to: obtain, from a bitstream, motion prediction mode information regarding a current block in a current picture, and when the obtained motion prediction mode information indicates a bi-directional motion prediction mode, obtain, from the bitstream, a first motion vector indicating a first reference block of the current block in a first reference picture and a second motion vector indicating a second reference block of the current block in a second reference picture, generate a gradient value of a first pixel in vertical direction from among pixels of the first reference block indicated by the first motion vector by applying a first one-dimensional gradient filter to a first neighboring region of the first pixel, generate a gradient value of the first pixel in horizontal direction by applying a second one-dimensional gradient filter to a second neighboring region of the first pixel, generate a gradient value of a second pixel in vertical direction from among pixels of the second reference block indicated by the second motion vector by applying a third one-dimensional gradient filter to a first neighboring region of the second pixel and generate a gradient value of the second pixel in horizontal direction by applying a fourth one-dimensional gradient filter to a second neighboring region of the second pixel, determine displacement vectors in horizontal direction and vertical direction, and generate a prediction pixel value of a current pixel in the current block by using a first value and a second value, wherein the current pixel corresponds to the first pixel and the second pixel, wherein the first value is generated by using a pixel value of the first pixel and a pixel value of the second pixel, the second value is generated by using the gradient values of the first pixel in vertical direction and in horizontal direction, the gradient values of the second pixel in vertical direction and in horizontal direction, and the displacement vectors in the horizontal direction and in the vertical direction, and wherein when the at least one processor applies a one-dimensional gradient filter to a neighboring region, a weighted sum of pixel values of pixels included in the neighboring region is determined, wherein weights for the weighted sum correspond to filter coefficients of the one-dimensional gradient filter, wherein when the at least one processor applies a one-dimensional gradient filter to generate a gradient value of one of the first pixel and the second pixel in one of vertical direction and horizontal direction, de-scaling is performed based on a de-scaling bit number on a value generated after the one-dimensional gradient filter is applied to at least one pixel value included in the neighboring region and is not performed on at least one coefficient of a one-dimensional gradient filter and is not performed on the at least one pixel value, wherein the de-scaling comprises bit-shifting to right by the de-scaling bit number, wherein the displacement vectors are clipped based on a threshold value when an intermediate value used for determining the displacement vectors is greater than a predetermined value, and wherein the displacement vectors are 0 when the intermediate value used for determining the displacement vectors is smaller than or equal to the predetermined value. 